./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.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.6.1.ufo.UNBOUNDED.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 ccd6fbf35fbbc8efdb8c53f020fbab2bec7c750b8b37d40c2d70f15f5e9d8bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:30:40,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:30:40,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:30:40,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:30:40,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:30:40,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:30:40,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:30:40,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:30:40,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:30:40,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:30:40,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:30:40,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:30:40,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:30:40,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:30:40,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:30:40,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:30:40,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:30:40,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:40,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:30:40,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:30:40,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:30:40,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:30:40,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:30:40,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:30:40,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:30:40,513 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 -> ccd6fbf35fbbc8efdb8c53f020fbab2bec7c750b8b37d40c2d70f15f5e9d8bef [2025-03-16 20:30:40,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:30:40,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:30:40,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:30:40,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:30:40,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:30:40,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:30:41,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc65d729/fef046cda8e94b96b3ca0db4b7c6bbd4/FLAG8841364ad [2025-03-16 20:30:42,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:30:42,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:30:42,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc65d729/fef046cda8e94b96b3ca0db4b7c6bbd4/FLAG8841364ad [2025-03-16 20:30:42,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc65d729/fef046cda8e94b96b3ca0db4b7c6bbd4 [2025-03-16 20:30:42,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:30:42,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:30:42,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:42,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:30:42,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:30:42,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:42" (1/1) ... [2025-03-16 20:30:42,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f69db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:42, skipping insertion in model container [2025-03-16 20:30:42,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:42" (1/1) ... [2025-03-16 20:30:42,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:30:42,521 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.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15547,15560] [2025-03-16 20:30:42,567 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.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c[22608,22621] [2025-03-16 20:30:42,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:42,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:30:42,973 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.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15547,15560] [2025-03-16 20:30:42,983 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.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c[22608,22621] [2025-03-16 20:30:43,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:43,254 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:30:43,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43 WrapperNode [2025-03-16 20:30:43,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:43,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:43,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:30:43,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:30:43,262 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:30:43" (1/1) ... [2025-03-16 20:30:43,295 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:30:43" (1/1) ... [2025-03-16 20:30:43,527 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-03-16 20:30:43,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:43,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:30:43,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:30:43,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:30:43,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,688 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:30:43,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:30:43,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:30:43,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:30:43,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:30:43,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (1/1) ... [2025-03-16 20:30:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:43,952 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:30:43,955 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:30:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:30:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:30:43,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:30:43,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:30:44,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:30:44,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:30:47,285 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc calculate_output2_#t~ret42#1; [2025-03-16 20:30:47,285 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5177: havoc calculate_output3_#t~ret43#1; [2025-03-16 20:30:47,285 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc calculate_output_#t~ret41#1; [2025-03-16 20:30:47,447 INFO L? ?]: Removed 745 outVars from TransFormulas that were not future-live. [2025-03-16 20:30:47,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:30:47,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:30:47,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:30:47,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:47 BoogieIcfgContainer [2025-03-16 20:30:47,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:30:47,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:30:47,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:30:47,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:30:47,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:30:42" (1/3) ... [2025-03-16 20:30:47,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650980e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:47, skipping insertion in model container [2025-03-16 20:30:47,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:43" (2/3) ... [2025-03-16 20:30:47,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650980e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:47, skipping insertion in model container [2025-03-16 20:30:47,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:47" (3/3) ... [2025-03-16 20:30:47,482 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-16 20:30:47,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:30:47,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 851 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:30:47,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:30:47,556 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;@79853962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:30:47,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:30:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states 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:30:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:47,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:47,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:47,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:47,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 382305243, now seen corresponding path program 1 times [2025-03-16 20:30:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790886446] [2025-03-16 20:30:47,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:47,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:47,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:47,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:47,761 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:30:47,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790886446] [2025-03-16 20:30:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790886446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:47,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:30:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039586167] [2025-03-16 20:30:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:47,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:30:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:47,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:30:47,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:30:47,782 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:47,845 INFO L93 Difference]: Finished difference Result 1658 states and 3256 transitions. [2025-03-16 20:30:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:30:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-16 20:30:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:47,858 INFO L225 Difference]: With dead ends: 1658 [2025-03-16 20:30:47,859 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:47,865 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:30:47,867 INFO L435 NwaCegarLoop]: 1606 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, 1606 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:30:47,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states 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:30:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2025-03-16 20:30:47,980 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2025-03-16 20:30:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:47,981 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2025-03-16 20:30:47,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2025-03-16 20:30:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:47,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:47,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:47,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:30:47,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -462166628, now seen corresponding path program 1 times [2025-03-16 20:30:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056170516] [2025-03-16 20:30:47,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:47,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:48,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:48,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:48,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:48,174 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:30:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056170516] [2025-03-16 20:30:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056170516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:30:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054098421] [2025-03-16 20:30:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:30:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:48,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:30:48,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:48,176 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:48,255 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2025-03-16 20:30:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:30:48,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-16 20:30:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:48,260 INFO L225 Difference]: With dead ends: 899 [2025-03-16 20:30:48,260 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:48,260 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:30:48,261 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:48,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4759 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states 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:30:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2025-03-16 20:30:48,282 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2025-03-16 20:30:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:48,282 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2025-03-16 20:30:48,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2025-03-16 20:30:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 20:30:48,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:48,283 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:30:48,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:30:48,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:48,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:48,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2004232584, now seen corresponding path program 1 times [2025-03-16 20:30:48,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87369801] [2025-03-16 20:30:48,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:48,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 20:30:48,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 20:30:48,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:48,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:48,364 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:30:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87369801] [2025-03-16 20:30:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87369801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:30:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755122116] [2025-03-16 20:30:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:48,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:48,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:48,368 INFO L87 Difference]: Start difference. First operand 847 states and 1562 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:30:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:50,960 INFO L93 Difference]: Finished difference Result 2351 states and 4435 transitions. [2025-03-16 20:30:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:50,961 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:30:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:50,968 INFO L225 Difference]: With dead ends: 2351 [2025-03-16 20:30:50,968 INFO L226 Difference]: Without dead ends: 1598 [2025-03-16 20:30:50,969 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:30:50,971 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 864 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 598 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.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:50,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 598 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:30:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2025-03-16 20:30:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2025-03-16 20:30:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1596 states have (on average 1.5921052631578947) internal successors, (2541), 1597 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states 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:30:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2541 transitions. [2025-03-16 20:30:51,007 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2541 transitions. Word has length 60 [2025-03-16 20:30:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:51,007 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2541 transitions. [2025-03-16 20:30:51,007 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:30:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2541 transitions. [2025-03-16 20:30:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:30:51,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:51,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:30:51,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash -858517098, now seen corresponding path program 1 times [2025-03-16 20:30:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546392514] [2025-03-16 20:30:51,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:51,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:30:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:30:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:51,201 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:30:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546392514] [2025-03-16 20:30:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546392514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:51,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:51,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884789966] [2025-03-16 20:30:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:51,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:51,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:51,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:51,204 INFO L87 Difference]: Start difference. First operand 1598 states and 2541 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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:30:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:51,441 INFO L93 Difference]: Finished difference Result 2186 states and 3489 transitions. [2025-03-16 20:30:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:30:51,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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:30:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:51,448 INFO L225 Difference]: With dead ends: 2186 [2025-03-16 20:30:51,448 INFO L226 Difference]: Without dead ends: 2137 [2025-03-16 20:30:51,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:30:51,450 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 9770 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9770 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:51,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9770 Valid, 3315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2025-03-16 20:30:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1645. [2025-03-16 20:30:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.592818015824711) internal successors, (2617), 1644 states have internal predecessors, (2617), 0 states have call successors, (0), 0 states 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:30:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2617 transitions. [2025-03-16 20:30:51,478 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2617 transitions. Word has length 62 [2025-03-16 20:30:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:51,478 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2617 transitions. [2025-03-16 20:30:51,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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:30:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2617 transitions. [2025-03-16 20:30:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:51,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:51,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:30:51,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash -364028136, now seen corresponding path program 1 times [2025-03-16 20:30:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073403965] [2025-03-16 20:30:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:51,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:51,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:51,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:51,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073403965] [2025-03-16 20:30:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073403965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783090489] [2025-03-16 20:30:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:51,736 INFO L87 Difference]: Start difference. First operand 1645 states and 2617 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:51,902 INFO L93 Difference]: Finished difference Result 1743 states and 2773 transitions. [2025-03-16 20:30:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:51,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:51,907 INFO L225 Difference]: With dead ends: 1743 [2025-03-16 20:30:51,907 INFO L226 Difference]: Without dead ends: 1647 [2025-03-16 20:30:51,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:30:51,908 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 3026 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:51,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 1938 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-16 20:30:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2025-03-16 20:30:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.5922093730979914) internal successors, (2616), 1644 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states 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:30:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2616 transitions. [2025-03-16 20:30:51,931 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2616 transitions. Word has length 64 [2025-03-16 20:30:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2616 transitions. [2025-03-16 20:30:51,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:30:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2616 transitions. [2025-03-16 20:30:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:51,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:51,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:51,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:30:51,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:51,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash -365070821, now seen corresponding path program 1 times [2025-03-16 20:30:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767497556] [2025-03-16 20:30:51,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:51,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:51,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:51,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:51,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,019 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:30:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767497556] [2025-03-16 20:30:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767497556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777389372] [2025-03-16 20:30:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,023 INFO L87 Difference]: Start difference. First operand 1645 states and 2616 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:30:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,051 INFO L93 Difference]: Finished difference Result 1826 states and 2905 transitions. [2025-03-16 20:30:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:52,051 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:30:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,056 INFO L225 Difference]: With dead ends: 1826 [2025-03-16 20:30:52,056 INFO L226 Difference]: Without dead ends: 1730 [2025-03-16 20:30:52,057 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:30:52,057 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:52,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1630 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-16 20:30:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1726. [2025-03-16 20:30:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.5910672853828307) internal successors, (2743), 1725 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states 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:30:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2743 transitions. [2025-03-16 20:30:52,086 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2743 transitions. Word has length 64 [2025-03-16 20:30:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,087 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2743 transitions. [2025-03-16 20:30:52,087 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:30:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2743 transitions. [2025-03-16 20:30:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:30:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:30:52,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1601014732, now seen corresponding path program 1 times [2025-03-16 20:30:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146388938] [2025-03-16 20:30:52,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:30:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:30:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,280 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:30:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146388938] [2025-03-16 20:30:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146388938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:30:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682361538] [2025-03-16 20:30:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:30:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:30:52,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:52,282 INFO L87 Difference]: Start difference. First operand 1726 states and 2743 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,318 INFO L93 Difference]: Finished difference Result 1732 states and 2750 transitions. [2025-03-16 20:30:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:30:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 20:30:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,324 INFO L225 Difference]: With dead ends: 1732 [2025-03-16 20:30:52,324 INFO L226 Difference]: Without dead ends: 1730 [2025-03-16 20:30:52,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:52,325 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 6221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7779 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:52,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7779 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-16 20:30:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2025-03-16 20:30:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1728 states have (on average 1.5891203703703705) internal successors, (2746), 1729 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states 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:30:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2746 transitions. [2025-03-16 20:30:52,355 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2746 transitions. Word has length 65 [2025-03-16 20:30:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2746 transitions. [2025-03-16 20:30:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:30:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2746 transitions. [2025-03-16 20:30:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:52,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:30:52,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1938748038, now seen corresponding path program 1 times [2025-03-16 20:30:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448104010] [2025-03-16 20:30:52,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:52,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:52,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,406 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:30:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448104010] [2025-03-16 20:30:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448104010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137221514] [2025-03-16 20:30:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,408 INFO L87 Difference]: Start difference. First operand 1730 states and 2746 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:30:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,463 INFO L93 Difference]: Finished difference Result 2076 states and 3286 transitions. [2025-03-16 20:30:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:52,464 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:30:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,469 INFO L225 Difference]: With dead ends: 2076 [2025-03-16 20:30:52,469 INFO L226 Difference]: Without dead ends: 1895 [2025-03-16 20:30:52,470 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:30:52,471 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1505 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1702 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:30:52,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-16 20:30:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2025-03-16 20:30:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 1.5848757271285034) internal successors, (2997), 1892 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states 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:30:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2997 transitions. [2025-03-16 20:30:52,505 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2997 transitions. Word has length 66 [2025-03-16 20:30:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,506 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2997 transitions. [2025-03-16 20:30:52,506 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:30:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2997 transitions. [2025-03-16 20:30:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:52,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:30:52,507 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1095389062, now seen corresponding path program 1 times [2025-03-16 20:30:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500028728] [2025-03-16 20:30:52,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:52,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,555 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:30:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500028728] [2025-03-16 20:30:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500028728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286554905] [2025-03-16 20:30:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,557 INFO L87 Difference]: Start difference. First operand 1893 states and 2997 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:30:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,582 INFO L93 Difference]: Finished difference Result 2549 states and 4011 transitions. [2025-03-16 20:30:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:52,583 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:30:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,589 INFO L225 Difference]: With dead ends: 2549 [2025-03-16 20:30:52,589 INFO L226 Difference]: Without dead ends: 2205 [2025-03-16 20:30:52,590 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:30:52,591 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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:30:52,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-03-16 20:30:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2203. [2025-03-16 20:30:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2201 states have (on average 1.57519309404816) internal successors, (3467), 2202 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states 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:30:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3467 transitions. [2025-03-16 20:30:52,628 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3467 transitions. Word has length 66 [2025-03-16 20:30:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,628 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3467 transitions. [2025-03-16 20:30:52,628 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:30:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3467 transitions. [2025-03-16 20:30:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:52,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:30:52,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash -338348422, now seen corresponding path program 1 times [2025-03-16 20:30:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247345409] [2025-03-16 20:30:52,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:52,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,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:30:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247345409] [2025-03-16 20:30:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247345409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780906821] [2025-03-16 20:30:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,679 INFO L87 Difference]: Start difference. First operand 2203 states and 3467 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:30:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,710 INFO L93 Difference]: Finished difference Result 3447 states and 5365 transitions. [2025-03-16 20:30:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:52,710 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:30:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,718 INFO L225 Difference]: With dead ends: 3447 [2025-03-16 20:30:52,718 INFO L226 Difference]: Without dead ends: 2793 [2025-03-16 20:30:52,719 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:30:52,720 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 1499 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1700 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:30:52,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1700 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-03-16 20:30:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2791. [2025-03-16 20:30:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2789 states have (on average 1.5571889566152743) internal successors, (4343), 2790 states have internal predecessors, (4343), 0 states have call successors, (0), 0 states 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:30:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4343 transitions. [2025-03-16 20:30:52,772 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4343 transitions. Word has length 66 [2025-03-16 20:30:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,772 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 4343 transitions. [2025-03-16 20:30:52,772 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:30:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4343 transitions. [2025-03-16 20:30:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:52,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:30:52,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -888137350, now seen corresponding path program 1 times [2025-03-16 20:30:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143914778] [2025-03-16 20:30:52,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:52,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,817 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:30:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143914778] [2025-03-16 20:30:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143914778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352297417] [2025-03-16 20:30:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,818 INFO L87 Difference]: Start difference. First operand 2791 states and 4343 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:30:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:52,858 INFO L93 Difference]: Finished difference Result 5147 states and 7881 transitions. [2025-03-16 20:30:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:52,859 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:30:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:52,870 INFO L225 Difference]: With dead ends: 5147 [2025-03-16 20:30:52,871 INFO L226 Difference]: Without dead ends: 3905 [2025-03-16 20:30:52,873 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:30:52,874 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1497 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1702 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:30:52,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2025-03-16 20:30:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3903. [2025-03-16 20:30:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3901 states have (on average 1.5296077928736223) internal successors, (5967), 3902 states have internal predecessors, (5967), 0 states have call successors, (0), 0 states 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:30:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 5967 transitions. [2025-03-16 20:30:52,944 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 5967 transitions. Word has length 66 [2025-03-16 20:30:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,945 INFO L471 AbstractCegarLoop]: Abstraction has 3903 states and 5967 transitions. [2025-03-16 20:30:52,945 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:30:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 5967 transitions. [2025-03-16 20:30:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:52,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:52,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:30:52,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -272166022, now seen corresponding path program 1 times [2025-03-16 20:30:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328936576] [2025-03-16 20:30:52,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:52,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:52,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:52,986 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:30:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328936576] [2025-03-16 20:30:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328936576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:52,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:52,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:52,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969220398] [2025-03-16 20:30:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:52,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:52,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:52,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:52,987 INFO L87 Difference]: Start difference. First operand 3903 states and 5967 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:30:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:53,044 INFO L93 Difference]: Finished difference Result 8355 states and 12529 transitions. [2025-03-16 20:30:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:53,044 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:30:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:53,067 INFO L225 Difference]: With dead ends: 8355 [2025-03-16 20:30:53,067 INFO L226 Difference]: Without dead ends: 6001 [2025-03-16 20:30:53,074 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:30:53,075 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1501 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1706 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:30:53,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1706 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2025-03-16 20:30:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5999. [2025-03-16 20:30:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5999 states, 5997 states have (on average 1.4939136234784058) internal successors, (8959), 5998 states have internal predecessors, (8959), 0 states have call successors, (0), 0 states 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:30:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5999 states to 5999 states and 8959 transitions. [2025-03-16 20:30:53,206 INFO L78 Accepts]: Start accepts. Automaton has 5999 states and 8959 transitions. Word has length 66 [2025-03-16 20:30:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:53,206 INFO L471 AbstractCegarLoop]: Abstraction has 5999 states and 8959 transitions. [2025-03-16 20:30:53,206 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:30:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5999 states and 8959 transitions. [2025-03-16 20:30:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:30:53,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:53,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:30:53,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1055373978, now seen corresponding path program 1 times [2025-03-16 20:30:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113740251] [2025-03-16 20:30:53,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:53,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:30:53,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:30:53,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:53,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:53,253 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:30:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113740251] [2025-03-16 20:30:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113740251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:53,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133081023] [2025-03-16 20:30:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:53,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:53,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:53,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:53,255 INFO L87 Difference]: Start difference. First operand 5999 states and 8959 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:30:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:53,343 INFO L93 Difference]: Finished difference Result 10614 states and 15813 transitions. [2025-03-16 20:30:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:53,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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:30:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:53,358 INFO L225 Difference]: With dead ends: 10614 [2025-03-16 20:30:53,359 INFO L226 Difference]: Without dead ends: 8115 [2025-03-16 20:30:53,364 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:30:53,364 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1504 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1703 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:30:53,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8115 states. [2025-03-16 20:30:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8115 to 8113. [2025-03-16 20:30:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8113 states, 8111 states have (on average 1.4795956108987793) internal successors, (12001), 8112 states have internal predecessors, (12001), 0 states have call successors, (0), 0 states 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:30:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8113 states to 8113 states and 12001 transitions. [2025-03-16 20:30:53,517 INFO L78 Accepts]: Start accepts. Automaton has 8113 states and 12001 transitions. Word has length 68 [2025-03-16 20:30:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:53,517 INFO L471 AbstractCegarLoop]: Abstraction has 8113 states and 12001 transitions. [2025-03-16 20:30:53,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:30:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8113 states and 12001 transitions. [2025-03-16 20:30:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:53,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:53,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:53,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:30:53,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1763107670, now seen corresponding path program 1 times [2025-03-16 20:30:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:53,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951640958] [2025-03-16 20:30:53,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:53,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:53,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:53,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:53,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:30:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951640958] [2025-03-16 20:30:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951640958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628051146] [2025-03-16 20:30:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:53,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:53,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:53,665 INFO L87 Difference]: Start difference. First operand 8113 states and 12001 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:54,242 INFO L93 Difference]: Finished difference Result 48831 states and 71112 transitions. [2025-03-16 20:30:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:54,317 INFO L225 Difference]: With dead ends: 48831 [2025-03-16 20:30:54,318 INFO L226 Difference]: Without dead ends: 42269 [2025-03-16 20:30:54,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:54,338 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8100 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8100 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:54,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8100 Valid, 3919 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42269 states. [2025-03-16 20:30:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42269 to 14673. [2025-03-16 20:30:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14673 states, 14671 states have (on average 1.4614545702406108) internal successors, (21441), 14672 states have internal predecessors, (21441), 0 states have call successors, (0), 0 states 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:30:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14673 states to 14673 states and 21441 transitions. [2025-03-16 20:30:54,833 INFO L78 Accepts]: Start accepts. Automaton has 14673 states and 21441 transitions. Word has length 86 [2025-03-16 20:30:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 14673 states and 21441 transitions. [2025-03-16 20:30:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:30:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14673 states and 21441 transitions. [2025-03-16 20:30:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:54,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:54,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:54,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:30:54,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -919748694, now seen corresponding path program 1 times [2025-03-16 20:30:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118869768] [2025-03-16 20:30:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:54,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:54,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:54,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:30:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:54,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118869768] [2025-03-16 20:30:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118869768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:54,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:54,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204521995] [2025-03-16 20:30:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:54,964 INFO L87 Difference]: Start difference. First operand 14673 states and 21441 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:30:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:55,549 INFO L93 Difference]: Finished difference Result 55391 states and 80552 transitions. [2025-03-16 20:30:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:55,620 INFO L225 Difference]: With dead ends: 55391 [2025-03-16 20:30:55,620 INFO L226 Difference]: Without dead ends: 48829 [2025-03-16 20:30:55,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:55,635 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8140 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8140 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:55,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8140 Valid, 3839 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48829 states. [2025-03-16 20:30:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48829 to 24529. [2025-03-16 20:30:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24529 states, 24527 states have (on average 1.4482407143148368) internal successors, (35521), 24528 states have internal predecessors, (35521), 0 states have call successors, (0), 0 states 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:30:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 35521 transitions. [2025-03-16 20:30:56,242 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 35521 transitions. Word has length 86 [2025-03-16 20:30:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 24529 states and 35521 transitions. [2025-03-16 20:30:56,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:30:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 35521 transitions. [2025-03-16 20:30:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:56,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:56,245 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:56,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:30:56,245 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:56,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash -162708054, now seen corresponding path program 1 times [2025-03-16 20:30:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:56,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087390310] [2025-03-16 20:30:56,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:56,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:56,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:56,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:56,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:30:56,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:56,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087390310] [2025-03-16 20:30:56,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087390310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:56,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238504661] [2025-03-16 20:30:56,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:56,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:56,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:56,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:56,385 INFO L87 Difference]: Start difference. First operand 24529 states and 35521 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:57,490 INFO L93 Difference]: Finished difference Result 61951 states and 89992 transitions. [2025-03-16 20:30:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:57,572 INFO L225 Difference]: With dead ends: 61951 [2025-03-16 20:30:57,572 INFO L226 Difference]: Without dead ends: 55389 [2025-03-16 20:30:57,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:57,599 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8211 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8211 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:57,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8211 Valid, 3850 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55389 states. [2025-03-16 20:30:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55389 to 31089. [2025-03-16 20:30:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31089 states, 31087 states have (on average 1.4462958793064624) internal successors, (44961), 31088 states have internal predecessors, (44961), 0 states have call successors, (0), 0 states 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:30:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31089 states to 31089 states and 44961 transitions. [2025-03-16 20:30:58,551 INFO L78 Accepts]: Start accepts. Automaton has 31089 states and 44961 transitions. Word has length 86 [2025-03-16 20:30:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 31089 states and 44961 transitions. [2025-03-16 20:30:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:30:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31089 states and 44961 transitions. [2025-03-16 20:30:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:58,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:58,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:58,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:30:58,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:58,555 INFO L85 PathProgramCache]: Analyzing trace with hash -712496982, now seen corresponding path program 1 times [2025-03-16 20:30:58,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:58,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674680582] [2025-03-16 20:30:58,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:58,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:58,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:58,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:58,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:58,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:30:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674680582] [2025-03-16 20:30:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674680582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032829778] [2025-03-16 20:30:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:58,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:58,688 INFO L87 Difference]: Start difference. First operand 31089 states and 44961 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:30:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:59,567 INFO L93 Difference]: Finished difference Result 68511 states and 99432 transitions. [2025-03-16 20:30:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:59,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:59,648 INFO L225 Difference]: With dead ends: 68511 [2025-03-16 20:30:59,648 INFO L226 Difference]: Without dead ends: 61949 [2025-03-16 20:30:59,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:30:59,663 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8126 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8126 SdHoareTripleChecker+Valid, 3875 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:59,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8126 Valid, 3875 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61949 states. [2025-03-16 20:31:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61949 to 37649. [2025-03-16 20:31:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37649 states, 37647 states have (on average 1.4450288203575319) internal successors, (54401), 37648 states have internal predecessors, (54401), 0 states have call successors, (0), 0 states 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:31:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37649 states to 37649 states and 54401 transitions. [2025-03-16 20:31:00,447 INFO L78 Accepts]: Start accepts. Automaton has 37649 states and 54401 transitions. Word has length 86 [2025-03-16 20:31:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:00,447 INFO L471 AbstractCegarLoop]: Abstraction has 37649 states and 54401 transitions. [2025-03-16 20:31:00,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:31:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 37649 states and 54401 transitions. [2025-03-16 20:31:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:31:00,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:00,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:00,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:31:00,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -96525654, now seen corresponding path program 1 times [2025-03-16 20:31:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997879902] [2025-03-16 20:31:00,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:00,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:31:00,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:31:00,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:00,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:31:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997879902] [2025-03-16 20:31:00,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997879902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:00,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:00,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:00,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605356330] [2025-03-16 20:31:00,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:00,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:00,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:00,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:00,638 INFO L87 Difference]: Start difference. First operand 37649 states and 54401 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:31:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:01,501 INFO L93 Difference]: Finished difference Result 75071 states and 108872 transitions. [2025-03-16 20:31:01,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:01,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 86 [2025-03-16 20:31:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:01,582 INFO L225 Difference]: With dead ends: 75071 [2025-03-16 20:31:01,582 INFO L226 Difference]: Without dead ends: 68509 [2025-03-16 20:31:01,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:01,608 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8042 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8042 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:01,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8042 Valid, 3975 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68509 states. [2025-03-16 20:31:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68509 to 44209. [2025-03-16 20:31:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44209 states, 44207 states have (on average 1.4441378062297827) internal successors, (63841), 44208 states have internal predecessors, (63841), 0 states have call successors, (0), 0 states 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:31:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44209 states to 44209 states and 63841 transitions. [2025-03-16 20:31:03,085 INFO L78 Accepts]: Start accepts. Automaton has 44209 states and 63841 transitions. Word has length 86 [2025-03-16 20:31:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 44209 states and 63841 transitions. [2025-03-16 20:31:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:31:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44209 states and 63841 transitions. [2025-03-16 20:31:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:31:03,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:03,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:31:03,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:03,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2092174036, now seen corresponding path program 1 times [2025-03-16 20:31:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218457070] [2025-03-16 20:31:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:03,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:31:03,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:31:03,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:03,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218457070] [2025-03-16 20:31:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218457070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:03,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288600009] [2025-03-16 20:31:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:03,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:03,189 INFO L87 Difference]: Start difference. First operand 44209 states and 63841 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:31:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:04,008 INFO L93 Difference]: Finished difference Result 74186 states and 107545 transitions. [2025-03-16 20:31:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 20:31:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:04,047 INFO L225 Difference]: With dead ends: 74186 [2025-03-16 20:31:04,047 INFO L226 Difference]: Without dead ends: 31528 [2025-03-16 20:31:04,060 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:31:04,061 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 58 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3157 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:31:04,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31528 states. [2025-03-16 20:31:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31528 to 31526. [2025-03-16 20:31:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31526 states, 31524 states have (on average 1.4512752188808526) internal successors, (45750), 31525 states have internal predecessors, (45750), 0 states have call successors, (0), 0 states 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:31:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31526 states to 31526 states and 45750 transitions. [2025-03-16 20:31:04,590 INFO L78 Accepts]: Start accepts. Automaton has 31526 states and 45750 transitions. Word has length 88 [2025-03-16 20:31:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:04,591 INFO L471 AbstractCegarLoop]: Abstraction has 31526 states and 45750 transitions. [2025-03-16 20:31:04,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:31:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31526 states and 45750 transitions. [2025-03-16 20:31:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:31:04,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:04,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:31:04,593 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1952924214, now seen corresponding path program 1 times [2025-03-16 20:31:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:04,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841431364] [2025-03-16 20:31:04,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:31:04,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:31:04,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:04,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:31:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841431364] [2025-03-16 20:31:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841431364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:31:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994695446] [2025-03-16 20:31:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:04,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:31:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:04,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:31:04,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:31:04,702 INFO L87 Difference]: Start difference. First operand 31526 states and 45750 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:31:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:05,521 INFO L93 Difference]: Finished difference Result 59188 states and 86077 transitions. [2025-03-16 20:31:05,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:31:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 88 [2025-03-16 20:31:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:05,583 INFO L225 Difference]: With dead ends: 59188 [2025-03-16 20:31:05,583 INFO L226 Difference]: Without dead ends: 54578 [2025-03-16 20:31:05,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 20:31:05,599 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8106 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8106 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:05,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8106 Valid, 4071 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:31:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54578 states. [2025-03-16 20:31:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54578 to 36134. [2025-03-16 20:31:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36134 states, 36132 states have (on average 1.4504040739510684) internal successors, (52406), 36133 states have internal predecessors, (52406), 0 states have call successors, (0), 0 states 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:31:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36134 states to 36134 states and 52406 transitions. [2025-03-16 20:31:06,332 INFO L78 Accepts]: Start accepts. Automaton has 36134 states and 52406 transitions. Word has length 88 [2025-03-16 20:31:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:06,333 INFO L471 AbstractCegarLoop]: Abstraction has 36134 states and 52406 transitions. [2025-03-16 20:31:06,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:31:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36134 states and 52406 transitions. [2025-03-16 20:31:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:31:06,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:06,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:06,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:31:06,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:06,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:06,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1726696622, now seen corresponding path program 1 times [2025-03-16 20:31:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:06,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756771114] [2025-03-16 20:31:06,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:31:06,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:31:06,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:06,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756771114] [2025-03-16 20:31:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756771114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153580654] [2025-03-16 20:31:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:06,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:06,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:06,405 INFO L87 Difference]: Start difference. First operand 36134 states and 52406 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:31:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:06,694 INFO L93 Difference]: Finished difference Result 53418 states and 77368 transitions. [2025-03-16 20:31:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 20:31:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:06,715 INFO L225 Difference]: With dead ends: 53418 [2025-03-16 20:31:06,715 INFO L226 Difference]: Without dead ends: 18856 [2025-03-16 20:31:06,745 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:31:06,746 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 53 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3142 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:31:06,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18856 states. [2025-03-16 20:31:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18856 to 18854. [2025-03-16 20:31:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18854 states, 18852 states have (on average 1.4431360067897305) internal successors, (27206), 18853 states have internal predecessors, (27206), 0 states have call successors, (0), 0 states 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:31:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18854 states to 18854 states and 27206 transitions. [2025-03-16 20:31:07,200 INFO L78 Accepts]: Start accepts. Automaton has 18854 states and 27206 transitions. Word has length 89 [2025-03-16 20:31:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,200 INFO L471 AbstractCegarLoop]: Abstraction has 18854 states and 27206 transitions. [2025-03-16 20:31:07,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:31:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 18854 states and 27206 transitions. [2025-03-16 20:31:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:31:07,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:07,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:31:07,202 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:07,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1478915573, now seen corresponding path program 1 times [2025-03-16 20:31:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465599942] [2025-03-16 20:31:07,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:31:07,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:31:07,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:07,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465599942] [2025-03-16 20:31:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465599942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020843314] [2025-03-16 20:31:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:07,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:07,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:07,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:07,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:07,271 INFO L87 Difference]: Start difference. First operand 18854 states and 27206 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:31:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:07,424 INFO L93 Difference]: Finished difference Result 27498 states and 39568 transitions. [2025-03-16 20:31:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 20:31:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:07,437 INFO L225 Difference]: With dead ends: 27498 [2025-03-16 20:31:07,438 INFO L226 Difference]: Without dead ends: 10216 [2025-03-16 20:31:07,451 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:31:07,455 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3127 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:31:07,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10216 states. [2025-03-16 20:31:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10216 to 10214. [2025-03-16 20:31:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10214 states, 10212 states have (on average 1.4420289855072463) internal successors, (14726), 10213 states have internal predecessors, (14726), 0 states have call successors, (0), 0 states 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:31:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 14726 transitions. [2025-03-16 20:31:07,641 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 14726 transitions. Word has length 91 [2025-03-16 20:31:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,641 INFO L471 AbstractCegarLoop]: Abstraction has 10214 states and 14726 transitions. [2025-03-16 20:31:07,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:31:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 14726 transitions. [2025-03-16 20:31:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:31:07,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:07,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:31:07,643 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 551699396, now seen corresponding path program 1 times [2025-03-16 20:31:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555617012] [2025-03-16 20:31:07,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:07,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:31:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:31:07,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555617012] [2025-03-16 20:31:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555617012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954203915] [2025-03-16 20:31:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:07,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:07,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:07,699 INFO L87 Difference]: Start difference. First operand 10214 states and 14726 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:31:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:07,778 INFO L93 Difference]: Finished difference Result 14538 states and 20848 transitions. [2025-03-16 20:31:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:07,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 20:31:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:07,787 INFO L225 Difference]: With dead ends: 14538 [2025-03-16 20:31:07,787 INFO L226 Difference]: Without dead ends: 5896 [2025-03-16 20:31:07,793 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:31:07,794 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 47 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3112 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:31:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3112 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2025-03-16 20:31:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5894. [2025-03-16 20:31:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5892 states have (on average 1.4504412763068568) internal successors, (8546), 5893 states have internal predecessors, (8546), 0 states have call successors, (0), 0 states 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:31:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 8546 transitions. [2025-03-16 20:31:07,893 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 8546 transitions. Word has length 93 [2025-03-16 20:31:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,893 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 8546 transitions. [2025-03-16 20:31:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:31:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 8546 transitions. [2025-03-16 20:31:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:31:07,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:31:07,895 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2030858365, now seen corresponding path program 1 times [2025-03-16 20:31:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056423775] [2025-03-16 20:31:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:07,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:31:07,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:31:07,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056423775] [2025-03-16 20:31:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056423775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268863649] [2025-03-16 20:31:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:07,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:07,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:07,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:07,952 INFO L87 Difference]: Start difference. First operand 5894 states and 8546 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:31:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:07,999 INFO L93 Difference]: Finished difference Result 8058 states and 11578 transitions. [2025-03-16 20:31:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:08,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 20:31:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:08,004 INFO L225 Difference]: With dead ends: 8058 [2025-03-16 20:31:08,004 INFO L226 Difference]: Without dead ends: 3736 [2025-03-16 20:31:08,007 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:31:08,007 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 44 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3097 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:31:08,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3097 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2025-03-16 20:31:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3734. [2025-03-16 20:31:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3732 states have (on average 1.469989281886388) internal successors, (5486), 3733 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states 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:31:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 5486 transitions. [2025-03-16 20:31:08,058 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 5486 transitions. Word has length 95 [2025-03-16 20:31:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:08,059 INFO L471 AbstractCegarLoop]: Abstraction has 3734 states and 5486 transitions. [2025-03-16 20:31:08,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:31:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 5486 transitions. [2025-03-16 20:31:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:31:08,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:08,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:08,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:31:08,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:08,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash 308650038, now seen corresponding path program 1 times [2025-03-16 20:31:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:08,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542992808] [2025-03-16 20:31:08,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:08,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:31:08,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:31:08,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:08,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:08,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542992808] [2025-03-16 20:31:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542992808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:08,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:08,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:08,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402457804] [2025-03-16 20:31:08,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:08,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:08,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:08,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:08,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:08,116 INFO L87 Difference]: Start difference. First operand 3734 states and 5486 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:08,147 INFO L93 Difference]: Finished difference Result 4818 states and 6988 transitions. [2025-03-16 20:31:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 20:31:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:08,152 INFO L225 Difference]: With dead ends: 4818 [2025-03-16 20:31:08,152 INFO L226 Difference]: Without dead ends: 2656 [2025-03-16 20:31:08,154 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:31:08,154 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 41 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3082 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:31:08,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3082 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2025-03-16 20:31:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654. [2025-03-16 20:31:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2652 states have (on average 1.4973604826546003) internal successors, (3971), 2653 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states 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:31:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3971 transitions. [2025-03-16 20:31:08,190 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3971 transitions. Word has length 97 [2025-03-16 20:31:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:08,190 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 3971 transitions. [2025-03-16 20:31:08,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3971 transitions. [2025-03-16 20:31:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 20:31:08,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:08,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:08,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:31:08,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 892035823, now seen corresponding path program 1 times [2025-03-16 20:31:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882936195] [2025-03-16 20:31:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:08,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:08,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:08,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882936195] [2025-03-16 20:31:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882936195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311646557] [2025-03-16 20:31:08,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:08,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:08,874 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:31:08,876 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:31:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:08,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:31:08,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:09,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311646557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:09,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:31:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222536411] [2025-03-16 20:31:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:09,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:31:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:09,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:31:09,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:31:09,592 INFO L87 Difference]: Start difference. First operand 2654 states and 3971 transitions. Second operand has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:31:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:13,174 INFO L93 Difference]: Finished difference Result 12648 states and 17467 transitions. [2025-03-16 20:31:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:31:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 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 99 [2025-03-16 20:31:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:13,187 INFO L225 Difference]: With dead ends: 12648 [2025-03-16 20:31:13,187 INFO L226 Difference]: Without dead ends: 11468 [2025-03-16 20:31:13,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:31:13,193 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 18098 mSDsluCounter, 8345 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18098 SdHoareTripleChecker+Valid, 9896 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:13,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18098 Valid, 9896 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:31:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11468 states. [2025-03-16 20:31:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11468 to 10798. [2025-03-16 20:31:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10798 states, 10796 states have (on average 1.3691181919229345) internal successors, (14781), 10797 states have internal predecessors, (14781), 0 states have call successors, (0), 0 states 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:31:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 14781 transitions. [2025-03-16 20:31:13,553 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 14781 transitions. Word has length 99 [2025-03-16 20:31:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:13,554 INFO L471 AbstractCegarLoop]: Abstraction has 10798 states and 14781 transitions. [2025-03-16 20:31:13,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:31:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 14781 transitions. [2025-03-16 20:31:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:13,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:13,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:13,563 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:31:13,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 20:31:13,756 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:13,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1400023222, now seen corresponding path program 1 times [2025-03-16 20:31:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568980610] [2025-03-16 20:31:13,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:13,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:13,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:13,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:13,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:14,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:14,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568980610] [2025-03-16 20:31:14,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568980610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:14,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412854177] [2025-03-16 20:31:14,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:14,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:14,182 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:31:14,191 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:31:14,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:14,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:14,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:14,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:31:14,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:14,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412854177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:15,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:15,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-16 20:31:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836024649] [2025-03-16 20:31:15,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 20:31:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:15,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 20:31:15,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-16 20:31:15,672 INFO L87 Difference]: Start difference. First operand 10798 states and 14781 transitions. Second operand has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:31:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:16,891 INFO L93 Difference]: Finished difference Result 23872 states and 32192 transitions. [2025-03-16 20:31:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:31:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 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 100 [2025-03-16 20:31:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:16,911 INFO L225 Difference]: With dead ends: 23872 [2025-03-16 20:31:16,911 INFO L226 Difference]: Without dead ends: 14834 [2025-03-16 20:31:16,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 20:31:16,919 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 20563 mSDsluCounter, 5189 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20563 SdHoareTripleChecker+Valid, 6703 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:16,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20563 Valid, 6703 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:31:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14834 states. [2025-03-16 20:31:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14834 to 13464. [2025-03-16 20:31:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13464 states, 13462 states have (on average 1.3392512256722626) internal successors, (18029), 13463 states have internal predecessors, (18029), 0 states have call successors, (0), 0 states 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:31:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 18029 transitions. [2025-03-16 20:31:17,255 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 18029 transitions. Word has length 100 [2025-03-16 20:31:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:17,255 INFO L471 AbstractCegarLoop]: Abstraction has 13464 states and 18029 transitions. [2025-03-16 20:31:17,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:31:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 18029 transitions. [2025-03-16 20:31:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:17,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:17,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:17,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:31:17,456 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,SelfDestructingSolverStorable26 [2025-03-16 20:31:17,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1450460490, now seen corresponding path program 1 times [2025-03-16 20:31:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855008762] [2025-03-16 20:31:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:17,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855008762] [2025-03-16 20:31:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855008762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386236895] [2025-03-16 20:31:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:17,766 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:31:17,768 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:31:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:17,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:17,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:31:17,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:18,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:18,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386236895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:18,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:18,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:31:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695209957] [2025-03-16 20:31:18,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:31:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:18,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:31:18,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:31:18,804 INFO L87 Difference]: Start difference. First operand 13464 states and 18029 transitions. Second operand has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:31:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:20,590 INFO L93 Difference]: Finished difference Result 41522 states and 54727 transitions. [2025-03-16 20:31:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 20:31:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 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 100 [2025-03-16 20:31:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:20,622 INFO L225 Difference]: With dead ends: 41522 [2025-03-16 20:31:20,622 INFO L226 Difference]: Without dead ends: 29640 [2025-03-16 20:31:20,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2247, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:31:20,634 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 15604 mSDsluCounter, 7072 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15604 SdHoareTripleChecker+Valid, 8648 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:20,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15604 Valid, 8648 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:31:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29640 states. [2025-03-16 20:31:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29640 to 29500. [2025-03-16 20:31:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29500 states, 29498 states have (on average 1.3107668316496033) internal successors, (38665), 29499 states have internal predecessors, (38665), 0 states have call successors, (0), 0 states 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:31:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29500 states to 29500 states and 38665 transitions. [2025-03-16 20:31:21,508 INFO L78 Accepts]: Start accepts. Automaton has 29500 states and 38665 transitions. Word has length 100 [2025-03-16 20:31:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:21,508 INFO L471 AbstractCegarLoop]: Abstraction has 29500 states and 38665 transitions. [2025-03-16 20:31:21,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:31:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 29500 states and 38665 transitions. [2025-03-16 20:31:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:31:21,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:21,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:21,517 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:31:21,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:21,710 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1441796728, now seen corresponding path program 1 times [2025-03-16 20:31:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708259970] [2025-03-16 20:31:21,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:21,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:21,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:21,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:21,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708259970] [2025-03-16 20:31:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708259970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636128905] [2025-03-16 20:31:22,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:22,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:22,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:22,094 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:31:22,095 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:31:22,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:22,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:22,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:22,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:22,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:31:22,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:22,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636128905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:23,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-03-16 20:31:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802368062] [2025-03-16 20:31:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:31:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:23,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:31:23,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:31:23,607 INFO L87 Difference]: Start difference. First operand 29500 states and 38665 transitions. Second operand has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:31:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:27,337 INFO L93 Difference]: Finished difference Result 113958 states and 148426 transitions. [2025-03-16 20:31:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 20:31:27,338 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 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 102 [2025-03-16 20:31:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:27,426 INFO L225 Difference]: With dead ends: 113958 [2025-03-16 20:31:27,427 INFO L226 Difference]: Without dead ends: 86096 [2025-03-16 20:31:27,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=739, Invalid=3043, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:31:27,445 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 21820 mSDsluCounter, 6813 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21820 SdHoareTripleChecker+Valid, 8339 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:27,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21820 Valid, 8339 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:31:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86096 states. [2025-03-16 20:31:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86096 to 85776. [2025-03-16 20:31:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85776 states, 85774 states have (on average 1.2835591204793995) internal successors, (110096), 85775 states have internal predecessors, (110096), 0 states have call successors, (0), 0 states 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:31:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85776 states to 85776 states and 110096 transitions. [2025-03-16 20:31:30,898 INFO L78 Accepts]: Start accepts. Automaton has 85776 states and 110096 transitions. Word has length 102 [2025-03-16 20:31:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 85776 states and 110096 transitions. [2025-03-16 20:31:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:31:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 85776 states and 110096 transitions. [2025-03-16 20:31:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:30,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:30,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:30,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:31:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:31:31,100 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2050371838, now seen corresponding path program 1 times [2025-03-16 20:31:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179212512] [2025-03-16 20:31:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:31,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:31,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:31,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179212512] [2025-03-16 20:31:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179212512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922330445] [2025-03-16 20:31:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:31,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:31,721 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:31:31,722 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:31:31,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:31,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:31,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:31,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:31:31,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:32,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922330445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:33,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-16 20:31:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693035908] [2025-03-16 20:31:33,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:31:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:33,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:31:33,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:31:33,174 INFO L87 Difference]: Start difference. First operand 85776 states and 110096 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:31:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:39,179 INFO L93 Difference]: Finished difference Result 199477 states and 255841 transitions. [2025-03-16 20:31:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 20:31:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 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 104 [2025-03-16 20:31:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:39,362 INFO L225 Difference]: With dead ends: 199477 [2025-03-16 20:31:39,362 INFO L226 Difference]: Without dead ends: 179134 [2025-03-16 20:31:39,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:31:39,391 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 13603 mSDsluCounter, 9415 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13603 SdHoareTripleChecker+Valid, 10964 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:39,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13603 Valid, 10964 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:31:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179134 states. [2025-03-16 20:31:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179134 to 86070. [2025-03-16 20:31:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86070 states, 86068 states have (on average 1.283171445833527) internal successors, (110440), 86069 states have internal predecessors, (110440), 0 states have call successors, (0), 0 states 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:31:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86070 states to 86070 states and 110440 transitions. [2025-03-16 20:31:42,923 INFO L78 Accepts]: Start accepts. Automaton has 86070 states and 110440 transitions. Word has length 104 [2025-03-16 20:31:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:42,923 INFO L471 AbstractCegarLoop]: Abstraction has 86070 states and 110440 transitions. [2025-03-16 20:31:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:31:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 86070 states and 110440 transitions. [2025-03-16 20:31:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:42,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:42,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 20:31:43,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:43,126 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:43,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1005936834, now seen corresponding path program 1 times [2025-03-16 20:31:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302180406] [2025-03-16 20:31:43,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:43,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302180406] [2025-03-16 20:31:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302180406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456433266] [2025-03-16 20:31:43,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:43,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:43,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:43,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:31:43,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:31:43,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:43,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:43,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:43,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:43,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-16 20:31:43,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:56,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:32:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:32:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456433266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:32:03,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:32:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 37, 38] total 84 [2025-03-16 20:32:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361609955] [2025-03-16 20:32:03,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:32:03,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2025-03-16 20:32:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:32:03,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2025-03-16 20:32:03,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=6145, Unknown=1, NotChecked=0, Total=6972 [2025-03-16 20:32:03,620 INFO L87 Difference]: Start difference. First operand 86070 states and 110440 transitions. Second operand has 84 states, 84 states have (on average 3.5595238095238093) internal successors, (299), 84 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)