./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b3076681f912d15400cc4a1f3a9bf78cf0eaf2d970cc5b4c395e45c99341df62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:25:40,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:25:40,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:25:40,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:25:40,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:25:40,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:25:40,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:25:40,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:25:40,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:25:40,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:25:40,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:25:40,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:25:40,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:25:40,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:25:40,866 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:25:40,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:25:40,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:25:40,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:40,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:40,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:40,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:25:40,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:25:40,869 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-jdk21/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 -> b3076681f912d15400cc4a1f3a9bf78cf0eaf2d970cc5b4c395e45c99341df62 [2025-01-09 14:25:41,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:25:41,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:25:41,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:25:41,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:25:41,189 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:25:41,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i [2025-01-09 14:25:42,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ed8d9b5b/17cd6aceb2c74933bd62d2ef05a036b8/FLAG2186dda10 [2025-01-09 14:25:42,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:25:42,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i [2025-01-09 14:25:42,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ed8d9b5b/17cd6aceb2c74933bd62d2ef05a036b8/FLAG2186dda10 [2025-01-09 14:25:43,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ed8d9b5b/17cd6aceb2c74933bd62d2ef05a036b8 [2025-01-09 14:25:43,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:25:43,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:25:43,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:43,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:25:43,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:25:43,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43, skipping insertion in model container [2025-01-09 14:25:43,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:25:43,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i[916,929] [2025-01-09 14:25:43,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:43,566 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:25:43,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-57.i[916,929] [2025-01-09 14:25:43,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:43,654 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:25:43,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43 WrapperNode [2025-01-09 14:25:43,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:43,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:43,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:25:43,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:25:43,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,704 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2025-01-09 14:25:43,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:43,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:25:43,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:25:43,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:25:43,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,747 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-01-09 14:25:43,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:25:43,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:25:43,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:25:43,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:25:43,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (1/1) ... [2025-01-09 14:25:43,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:43,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:25:43,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:25:43,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:25:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:25:43,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:25:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:25:43,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:25:43,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:25:43,914 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:25:43,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:25:44,633 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-01-09 14:25:44,633 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:25:44,646 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:25:44,648 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:25:44,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:44 BoogieIcfgContainer [2025-01-09 14:25:44,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:25:44,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:25:44,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:25:44,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:25:44,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:25:43" (1/3) ... [2025-01-09 14:25:44,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e72bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:44, skipping insertion in model container [2025-01-09 14:25:44,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:43" (2/3) ... [2025-01-09 14:25:44,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e72bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:44, skipping insertion in model container [2025-01-09 14:25:44,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:44" (3/3) ... [2025-01-09 14:25:44,654 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-57.i [2025-01-09 14:25:44,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:25:44,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-57.i that has 2 procedures, 217 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:25:44,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:25:44,720 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;@20de8257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:25:44,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:25:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 14:25:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 14:25:44,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:44,744 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:44,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:44,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -68382087, now seen corresponding path program 1 times [2025-01-09 14:25:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931146034] [2025-01-09 14:25:44,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 14:25:44,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 14:25:44,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:44,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-01-09 14:25:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931146034] [2025-01-09 14:25:45,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931146034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:45,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683083160] [2025-01-09 14:25:45,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:45,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:45,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:25:45,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 14:25:45,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 14:25:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:25:45,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-01-09 14:25:45,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:25:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683083160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:25:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:25:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8375554] [2025-01-09 14:25:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:25:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:45,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:25:45,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:45,535 INFO L87 Difference]: Start difference. First operand has 217 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:25:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:45,571 INFO L93 Difference]: Finished difference Result 428 states and 748 transitions. [2025-01-09 14:25:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:25:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) Word has length 362 [2025-01-09 14:25:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:45,580 INFO L225 Difference]: With dead ends: 428 [2025-01-09 14:25:45,580 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 14:25:45,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 363 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-01-09 14:25:45,585 INFO L435 NwaCegarLoop]: 344 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, 344 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-01-09 14:25:45,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 14:25:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-09 14:25:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 157 states have internal predecessors, (234), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-01-09 14:25:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 344 transitions. [2025-01-09 14:25:45,657 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 344 transitions. Word has length 362 [2025-01-09 14:25:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:45,660 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 344 transitions. [2025-01-09 14:25:45,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:25:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 344 transitions. [2025-01-09 14:25:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-09 14:25:45,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:45,666 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:45,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:25:45,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:25:45,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 582930627, now seen corresponding path program 1 times [2025-01-09 14:25:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465007015] [2025-01-09 14:25:45,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:45,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 14:25:45,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 14:25:45,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:45,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:25:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:46,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465007015] [2025-01-09 14:25:46,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465007015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:46,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:46,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077071803] [2025-01-09 14:25:46,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:46,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:46,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:46,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:46,374 INFO L87 Difference]: Start difference. First operand 214 states and 344 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:46,937 INFO L93 Difference]: Finished difference Result 847 states and 1367 transitions. [2025-01-09 14:25:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 362 [2025-01-09 14:25:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:46,943 INFO L225 Difference]: With dead ends: 847 [2025-01-09 14:25:46,943 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 14:25:46,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:46,945 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 831 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:46,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 992 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:25:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 14:25:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 488. [2025-01-09 14:25:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 375 states have (on average 1.5413333333333334) internal successors, (578), 375 states have internal predecessors, (578), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 14:25:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 798 transitions. [2025-01-09 14:25:47,016 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 798 transitions. Word has length 362 [2025-01-09 14:25:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:47,017 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 798 transitions. [2025-01-09 14:25:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 798 transitions. [2025-01-09 14:25:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 14:25:47,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:47,021 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:25:47,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 20634895, now seen corresponding path program 1 times [2025-01-09 14:25:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027893237] [2025-01-09 14:25:47,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:47,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 14:25:47,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 14:25:47,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:47,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:25:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027893237] [2025-01-09 14:25:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027893237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315865478] [2025-01-09 14:25:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:47,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:47,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:47,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:47,306 INFO L87 Difference]: Start difference. First operand 488 states and 798 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:47,917 INFO L93 Difference]: Finished difference Result 1467 states and 2369 transitions. [2025-01-09 14:25:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-01-09 14:25:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:47,924 INFO L225 Difference]: With dead ends: 1467 [2025-01-09 14:25:47,924 INFO L226 Difference]: Without dead ends: 982 [2025-01-09 14:25:47,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:47,926 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 715 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:47,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1189 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:25:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-01-09 14:25:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 550. [2025-01-09 14:25:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 437 states have (on average 1.5675057208237986) internal successors, (685), 437 states have internal predecessors, (685), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 14:25:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 905 transitions. [2025-01-09 14:25:47,983 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 905 transitions. Word has length 363 [2025-01-09 14:25:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:47,984 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 905 transitions. [2025-01-09 14:25:47,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 905 transitions. [2025-01-09 14:25:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 14:25:47,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:47,989 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:47,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:25:47,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash 731325481, now seen corresponding path program 1 times [2025-01-09 14:25:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124916535] [2025-01-09 14:25:47,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:48,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 14:25:48,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 14:25:48,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:48,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:25:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124916535] [2025-01-09 14:25:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124916535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992712958] [2025-01-09 14:25:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:48,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:48,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:48,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:48,272 INFO L87 Difference]: Start difference. First operand 550 states and 905 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:48,586 INFO L93 Difference]: Finished difference Result 1921 states and 3135 transitions. [2025-01-09 14:25:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 363 [2025-01-09 14:25:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:48,593 INFO L225 Difference]: With dead ends: 1921 [2025-01-09 14:25:48,594 INFO L226 Difference]: Without dead ends: 1374 [2025-01-09 14:25:48,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:48,596 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 622 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:48,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1018 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-01-09 14:25:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 824. [2025-01-09 14:25:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 655 states have (on average 1.5709923664122138) internal successors, (1029), 655 states have internal predecessors, (1029), 165 states have call successors, (165), 3 states have call predecessors, (165), 3 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-01-09 14:25:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1359 transitions. [2025-01-09 14:25:48,650 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1359 transitions. Word has length 363 [2025-01-09 14:25:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:48,651 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1359 transitions. [2025-01-09 14:25:48,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:25:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1359 transitions. [2025-01-09 14:25:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-09 14:25:48,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:48,653 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:48,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:25:48,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:48,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1306168367, now seen corresponding path program 1 times [2025-01-09 14:25:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704825401] [2025-01-09 14:25:48,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:48,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 14:25:48,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 14:25:48,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:48,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:25:49,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704825401] [2025-01-09 14:25:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704825401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:49,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:49,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:25:49,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691909395] [2025-01-09 14:25:49,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:49,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:25:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:49,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:25:49,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:49,388 INFO L87 Difference]: Start difference. First operand 824 states and 1359 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:25:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:49,959 INFO L93 Difference]: Finished difference Result 2834 states and 4682 transitions. [2025-01-09 14:25:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 363 [2025-01-09 14:25:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:49,970 INFO L225 Difference]: With dead ends: 2834 [2025-01-09 14:25:49,970 INFO L226 Difference]: Without dead ends: 2013 [2025-01-09 14:25:49,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:25:49,974 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 641 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:49,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1678 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2025-01-09 14:25:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1949. [2025-01-09 14:25:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1612 states have (on average 1.5955334987593053) internal successors, (2572), 1612 states have internal predecessors, (2572), 330 states have call successors, (330), 6 states have call predecessors, (330), 6 states have return successors, (330), 330 states have call predecessors, (330), 330 states have call successors, (330) [2025-01-09 14:25:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3232 transitions. [2025-01-09 14:25:50,098 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3232 transitions. Word has length 363 [2025-01-09 14:25:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:50,099 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 3232 transitions. [2025-01-09 14:25:50,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-01-09 14:25:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3232 transitions. [2025-01-09 14:25:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-01-09 14:25:50,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:50,102 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:25:50,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:25:50,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1450339802, now seen corresponding path program 1 times [2025-01-09 14:25:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939361254] [2025-01-09 14:25:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-01-09 14:25:50,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-01-09 14:25:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:25:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939361254] [2025-01-09 14:25:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939361254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:25:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371979128] [2025-01-09 14:25:51,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:51,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:25:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:51,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:25:51,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:25:51,507 INFO L87 Difference]: Start difference. First operand 1949 states and 3232 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:00,366 INFO L93 Difference]: Finished difference Result 12647 states and 20715 transitions. [2025-01-09 14:26:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 14:26:00,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 364 [2025-01-09 14:26:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:00,407 INFO L225 Difference]: With dead ends: 12647 [2025-01-09 14:26:00,408 INFO L226 Difference]: Without dead ends: 10701 [2025-01-09 14:26:00,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 14:26:00,417 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 2620 mSDsluCounter, 7403 mSDsCounter, 0 mSdLazyCounter, 5628 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2620 SdHoareTripleChecker+Valid, 8689 SdHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 5628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:00,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2620 Valid, 8689 Invalid, 6078 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [450 Valid, 5628 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 14:26:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10701 states. [2025-01-09 14:26:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10701 to 6327. [2025-01-09 14:26:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 5386 states have (on average 1.6049015967322688) internal successors, (8644), 5398 states have internal predecessors, (8644), 912 states have call successors, (912), 28 states have call predecessors, (912), 28 states have return successors, (912), 900 states have call predecessors, (912), 912 states have call successors, (912) [2025-01-09 14:26:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 10468 transitions. [2025-01-09 14:26:00,981 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 10468 transitions. Word has length 364 [2025-01-09 14:26:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:00,983 INFO L471 AbstractCegarLoop]: Abstraction has 6327 states and 10468 transitions. [2025-01-09 14:26:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 10468 transitions. [2025-01-09 14:26:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-01-09 14:26:00,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:00,992 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:00,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:26:00,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 759078810, now seen corresponding path program 1 times [2025-01-09 14:26:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470546478] [2025-01-09 14:26:00,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:00,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:01,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-01-09 14:26:01,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-01-09 14:26:01,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:01,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470546478] [2025-01-09 14:26:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470546478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402207507] [2025-01-09 14:26:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:01,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:01,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:01,429 INFO L87 Difference]: Start difference. First operand 6327 states and 10468 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:01,702 INFO L93 Difference]: Finished difference Result 12723 states and 21041 transitions. [2025-01-09 14:26:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:01,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 364 [2025-01-09 14:26:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:01,732 INFO L225 Difference]: With dead ends: 12723 [2025-01-09 14:26:01,733 INFO L226 Difference]: Without dead ends: 6399 [2025-01-09 14:26:01,743 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-01-09 14:26:01,744 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:01,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1018 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2025-01-09 14:26:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6399. [2025-01-09 14:26:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 5458 states have (on average 1.59582264565775) internal successors, (8710), 5470 states have internal predecessors, (8710), 912 states have call successors, (912), 28 states have call predecessors, (912), 28 states have return successors, (912), 900 states have call predecessors, (912), 912 states have call successors, (912) [2025-01-09 14:26:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 10534 transitions. [2025-01-09 14:26:02,108 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 10534 transitions. Word has length 364 [2025-01-09 14:26:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 10534 transitions. [2025-01-09 14:26:02,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 10534 transitions. [2025-01-09 14:26:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:26:02,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:02,115 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:02,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:26:02,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1673668155, now seen corresponding path program 1 times [2025-01-09 14:26:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685153580] [2025-01-09 14:26:02,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:02,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:02,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:26:02,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:26:02,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:02,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:03,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685153580] [2025-01-09 14:26:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685153580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:03,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:03,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:26:03,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742865714] [2025-01-09 14:26:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:03,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:26:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:03,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:26:03,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:26:03,307 INFO L87 Difference]: Start difference. First operand 6399 states and 10534 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:09,220 INFO L93 Difference]: Finished difference Result 27836 states and 45278 transitions. [2025-01-09 14:26:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 14:26:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 365 [2025-01-09 14:26:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:09,399 INFO L225 Difference]: With dead ends: 27836 [2025-01-09 14:26:09,399 INFO L226 Difference]: Without dead ends: 24535 [2025-01-09 14:26:09,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:26:09,468 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 2414 mSDsluCounter, 4828 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2414 SdHoareTripleChecker+Valid, 5657 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:09,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2414 Valid, 5657 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 14:26:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24535 states. [2025-01-09 14:26:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24535 to 10549. [2025-01-09 14:26:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 9312 states have (on average 1.6272551546391754) internal successors, (15153), 9336 states have internal predecessors, (15153), 1188 states have call successors, (1188), 48 states have call predecessors, (1188), 48 states have return successors, (1188), 1164 states have call predecessors, (1188), 1188 states have call successors, (1188) [2025-01-09 14:26:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 17529 transitions. [2025-01-09 14:26:10,272 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 17529 transitions. Word has length 365 [2025-01-09 14:26:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:10,273 INFO L471 AbstractCegarLoop]: Abstraction has 10549 states and 17529 transitions. [2025-01-09 14:26:10,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 17529 transitions. [2025-01-09 14:26:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:26:10,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:10,284 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:10,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:26:10,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1454813437, now seen corresponding path program 1 times [2025-01-09 14:26:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428881941] [2025-01-09 14:26:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:26:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:26:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428881941] [2025-01-09 14:26:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428881941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:26:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494777368] [2025-01-09 14:26:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:26:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:26:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:11,199 INFO L87 Difference]: Start difference. First operand 10549 states and 17529 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:15,912 INFO L93 Difference]: Finished difference Result 65745 states and 109263 transitions. [2025-01-09 14:26:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:26:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 365 [2025-01-09 14:26:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:16,067 INFO L225 Difference]: With dead ends: 65745 [2025-01-09 14:26:16,067 INFO L226 Difference]: Without dead ends: 55199 [2025-01-09 14:26:16,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:26:16,100 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 2318 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:16,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 2644 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 14:26:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55199 states. [2025-01-09 14:26:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55199 to 22633. [2025-01-09 14:26:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22633 states, 20160 states have (on average 1.6267361111111112) internal successors, (32795), 20208 states have internal predecessors, (32795), 2376 states have call successors, (2376), 96 states have call predecessors, (2376), 96 states have return successors, (2376), 2328 states have call predecessors, (2376), 2376 states have call successors, (2376) [2025-01-09 14:26:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22633 states to 22633 states and 37547 transitions. [2025-01-09 14:26:17,713 INFO L78 Accepts]: Start accepts. Automaton has 22633 states and 37547 transitions. Word has length 365 [2025-01-09 14:26:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:17,714 INFO L471 AbstractCegarLoop]: Abstraction has 22633 states and 37547 transitions. [2025-01-09 14:26:17,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 22633 states and 37547 transitions. [2025-01-09 14:26:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:26:17,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:17,729 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:17,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:26:17,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -255550587, now seen corresponding path program 1 times [2025-01-09 14:26:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088213945] [2025-01-09 14:26:17,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:17,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:26:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:26:17,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:18,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:18,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088213945] [2025-01-09 14:26:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088213945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:18,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:18,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554438591] [2025-01-09 14:26:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:18,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:18,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:18,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:18,181 INFO L87 Difference]: Start difference. First operand 22633 states and 37547 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:20,599 INFO L93 Difference]: Finished difference Result 81721 states and 133581 transitions. [2025-01-09 14:26:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:26:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 365 [2025-01-09 14:26:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:20,758 INFO L225 Difference]: With dead ends: 81721 [2025-01-09 14:26:20,758 INFO L226 Difference]: Without dead ends: 59091 [2025-01-09 14:26:20,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:20,808 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 487 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:20,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1150 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59091 states. [2025-01-09 14:26:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59091 to 44081. [2025-01-09 14:26:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44081 states, 39136 states have (on average 1.6142170891251022) internal successors, (63174), 39232 states have internal predecessors, (63174), 4752 states have call successors, (4752), 192 states have call predecessors, (4752), 192 states have return successors, (4752), 4656 states have call predecessors, (4752), 4752 states have call successors, (4752) [2025-01-09 14:26:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44081 states to 44081 states and 72678 transitions. [2025-01-09 14:26:23,855 INFO L78 Accepts]: Start accepts. Automaton has 44081 states and 72678 transitions. Word has length 365 [2025-01-09 14:26:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:23,856 INFO L471 AbstractCegarLoop]: Abstraction has 44081 states and 72678 transitions. [2025-01-09 14:26:23,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 44081 states and 72678 transitions. [2025-01-09 14:26:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:26:23,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:23,875 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:26:23,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -331092905, now seen corresponding path program 1 times [2025-01-09 14:26:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153832997] [2025-01-09 14:26:23,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:23,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:26:23,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:26:23,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:23,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153832997] [2025-01-09 14:26:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153832997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573994389] [2025-01-09 14:26:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:24,271 INFO L87 Difference]: Start difference. First operand 44081 states and 72678 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:26,854 INFO L93 Difference]: Finished difference Result 112143 states and 184744 transitions. [2025-01-09 14:26:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 366 [2025-01-09 14:26:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:27,021 INFO L225 Difference]: With dead ends: 112143 [2025-01-09 14:26:27,021 INFO L226 Difference]: Without dead ends: 68065 [2025-01-09 14:26:27,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:27,096 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 133 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:27,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 981 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:26:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68065 states. [2025-01-09 14:26:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68065 to 60111. [2025-01-09 14:26:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60111 states, 55166 states have (on average 1.641083275930827) internal successors, (90532), 55262 states have internal predecessors, (90532), 4752 states have call successors, (4752), 192 states have call predecessors, (4752), 192 states have return successors, (4752), 4656 states have call predecessors, (4752), 4752 states have call successors, (4752) [2025-01-09 14:26:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60111 states to 60111 states and 100036 transitions. [2025-01-09 14:26:30,650 INFO L78 Accepts]: Start accepts. Automaton has 60111 states and 100036 transitions. Word has length 366 [2025-01-09 14:26:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 60111 states and 100036 transitions. [2025-01-09 14:26:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 60111 states and 100036 transitions. [2025-01-09 14:26:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-01-09 14:26:30,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:30,670 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:26:30,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 213440420, now seen corresponding path program 1 times [2025-01-09 14:26:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823456722] [2025-01-09 14:26:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:30,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-01-09 14:26:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-01-09 14:26:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823456722] [2025-01-09 14:26:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823456722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:26:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930985705] [2025-01-09 14:26:31,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:26:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:31,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:26:31,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:31,028 INFO L87 Difference]: Start difference. First operand 60111 states and 100036 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:35,446 INFO L93 Difference]: Finished difference Result 145644 states and 241461 transitions. [2025-01-09 14:26:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:26:35,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 368 [2025-01-09 14:26:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:35,629 INFO L225 Difference]: With dead ends: 145644 [2025-01-09 14:26:35,629 INFO L226 Difference]: Without dead ends: 85536 [2025-01-09 14:26:35,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:35,723 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 583 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:35,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 2795 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:26:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85536 states. [2025-01-09 14:26:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85536 to 79985. [2025-01-09 14:26:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79985 states, 73335 states have (on average 1.6377582327674371) internal successors, (120105), 73464 states have internal predecessors, (120105), 6391 states have call successors, (6391), 258 states have call predecessors, (6391), 258 states have return successors, (6391), 6262 states have call predecessors, (6391), 6391 states have call successors, (6391) [2025-01-09 14:26:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79985 states to 79985 states and 132887 transitions. [2025-01-09 14:26:40,406 INFO L78 Accepts]: Start accepts. Automaton has 79985 states and 132887 transitions. Word has length 368 [2025-01-09 14:26:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 79985 states and 132887 transitions. [2025-01-09 14:26:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 79985 states and 132887 transitions. [2025-01-09 14:26:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:26:40,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:40,426 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:40,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:26:40,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 155317544, now seen corresponding path program 1 times [2025-01-09 14:26:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624484911] [2025-01-09 14:26:40,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:40,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:26:40,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:26:40,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:40,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624484911] [2025-01-09 14:26:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624484911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637346958] [2025-01-09 14:26:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:40,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:40,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:40,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:40,564 INFO L87 Difference]: Start difference. First operand 79985 states and 132887 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:44,850 INFO L93 Difference]: Finished difference Result 165329 states and 273806 transitions. [2025-01-09 14:26:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 369 [2025-01-09 14:26:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:45,010 INFO L225 Difference]: With dead ends: 165329 [2025-01-09 14:26:45,010 INFO L226 Difference]: Without dead ends: 85445 [2025-01-09 14:26:45,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:45,088 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 545 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:45,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1273 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:26:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85445 states. [2025-01-09 14:26:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85445 to 80057. [2025-01-09 14:26:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80057 states, 73407 states have (on average 1.6351710327352977) internal successors, (120033), 73536 states have internal predecessors, (120033), 6391 states have call successors, (6391), 258 states have call predecessors, (6391), 258 states have return successors, (6391), 6262 states have call predecessors, (6391), 6391 states have call successors, (6391) [2025-01-09 14:26:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80057 states to 80057 states and 132815 transitions. [2025-01-09 14:26:49,625 INFO L78 Accepts]: Start accepts. Automaton has 80057 states and 132815 transitions. Word has length 369 [2025-01-09 14:26:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:49,625 INFO L471 AbstractCegarLoop]: Abstraction has 80057 states and 132815 transitions. [2025-01-09 14:26:49,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 80057 states and 132815 transitions. [2025-01-09 14:26:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:26:49,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:49,645 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:49,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:26:49,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:49,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 390206505, now seen corresponding path program 1 times [2025-01-09 14:26:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88566817] [2025-01-09 14:26:49,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:49,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:26:49,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:26:49,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:26:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88566817] [2025-01-09 14:26:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88566817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:50,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:50,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:26:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156718935] [2025-01-09 14:26:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:26:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:26:50,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:50,032 INFO L87 Difference]: Start difference. First operand 80057 states and 132815 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:26:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:55,790 INFO L93 Difference]: Finished difference Result 174013 states and 285149 transitions. [2025-01-09 14:26:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:26:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 369 [2025-01-09 14:26:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:55,997 INFO L225 Difference]: With dead ends: 174013 [2025-01-09 14:26:55,997 INFO L226 Difference]: Without dead ends: 112673 [2025-01-09 14:26:56,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:26:56,086 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 590 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:56,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1651 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:26:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112673 states. [2025-01-09 14:27:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112673 to 84575. [2025-01-09 14:27:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84575 states, 77925 states have (on average 1.64223291626564) internal successors, (127971), 78054 states have internal predecessors, (127971), 6391 states have call successors, (6391), 258 states have call predecessors, (6391), 258 states have return successors, (6391), 6262 states have call predecessors, (6391), 6391 states have call successors, (6391) [2025-01-09 14:27:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84575 states to 84575 states and 140753 transitions. [2025-01-09 14:27:01,454 INFO L78 Accepts]: Start accepts. Automaton has 84575 states and 140753 transitions. Word has length 369 [2025-01-09 14:27:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 84575 states and 140753 transitions. [2025-01-09 14:27:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-01-09 14:27:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 84575 states and 140753 transitions. [2025-01-09 14:27:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-09 14:27:01,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:01,476 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:27:01,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:01,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash 49783520, now seen corresponding path program 1 times [2025-01-09 14:27:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449068438] [2025-01-09 14:27:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-09 14:27:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-09 14:27:01,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:01,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-01-09 14:27:01,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449068438] [2025-01-09 14:27:01,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449068438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:01,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:01,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:27:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114171969] [2025-01-09 14:27:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:27:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:01,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:27:01,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:27:01,759 INFO L87 Difference]: Start difference. First operand 84575 states and 140753 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55)