./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a99e37bd4c1789c639eeb1fddddb52ff04b95cd337cf1d9ec2d82c2bdc4500 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:48:52,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:48:52,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:48:52,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:48:52,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:48:52,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:48:52,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:48:52,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:48:52,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:48:52,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:48:52,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:48:52,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:48:52,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:48:52,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:48:52,785 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:48:52,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:48:52,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:48:52,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:52,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:48:52,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:48:52,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44a99e37bd4c1789c639eeb1fddddb52ff04b95cd337cf1d9ec2d82c2bdc4500 [2025-03-08 15:48:53,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:48:53,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:48:53,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:48:53,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:48:53,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:48:53,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i [2025-03-08 15:48:54,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05842b78f/9477bc87f2e6441680e26322d03a6dd3/FLAG66404f431 [2025-03-08 15:48:54,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:48:54,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i [2025-03-08 15:48:54,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05842b78f/9477bc87f2e6441680e26322d03a6dd3/FLAG66404f431 [2025-03-08 15:48:54,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05842b78f/9477bc87f2e6441680e26322d03a6dd3 [2025-03-08 15:48:54,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:48:54,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:48:54,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:54,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:48:54,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:48:54,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:54" (1/1) ... [2025-03-08 15:48:54,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39984670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:54, skipping insertion in model container [2025-03-08 15:48:54,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:48:54" (1/1) ... [2025-03-08 15:48:54,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:48:54,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i[916,929] [2025-03-08 15:48:55,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:55,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:48:55,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-91.i[916,929] [2025-03-08 15:48:55,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:48:55,181 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:48:55,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55 WrapperNode [2025-03-08 15:48:55,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:48:55,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:55,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:48:55,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:48:55,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,284 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 804 [2025-03-08 15:48:55,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:48:55,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:48:55,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:48:55,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:48:55,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:48:55,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:48:55,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:48:55,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:48:55,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:48:55,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (1/1) ... [2025-03-08 15:48:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:48:55,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:55,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:48:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:48:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:48:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:48:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:48:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:48:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:48:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:48:55,645 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:48:55,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:48:56,654 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc property_#t~bitwise51#1;havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~ite56#1;havoc property_#t~bitwise54#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~bitwise58#1;havoc property_#t~short59#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short63#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short71#1; [2025-03-08 15:48:56,773 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-08 15:48:56,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:48:56,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:48:56,796 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:48:56,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:56 BoogieIcfgContainer [2025-03-08 15:48:56,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:48:56,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:48:56,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:48:56,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:48:56,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:48:54" (1/3) ... [2025-03-08 15:48:56,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fae98b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:56, skipping insertion in model container [2025-03-08 15:48:56,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:48:55" (2/3) ... [2025-03-08 15:48:56,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fae98b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:48:56, skipping insertion in model container [2025-03-08 15:48:56,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:48:56" (3/3) ... [2025-03-08 15:48:56,806 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-91.i [2025-03-08 15:48:56,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:48:56,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-91.i that has 2 procedures, 313 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:48:56,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:48:56,881 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;@400f7e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:48:56,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:48:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 245 states have internal predecessors, (378), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:48:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:48:56,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:56,901 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:56,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1424389091, now seen corresponding path program 1 times [2025-03-08 15:48:56,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365358331] [2025-03-08 15:48:56,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:57,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:48:57,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:48:57,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:57,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:48:57,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365358331] [2025-03-08 15:48:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365358331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472511962] [2025-03-08 15:48:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:57,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:57,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:57,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:57,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:48:57,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:48:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:48:57,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:57,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:57,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:48:57,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:48:57,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:48:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472511962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:57,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:48:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:48:57,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573186447] [2025-03-08 15:48:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:57,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:48:57,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:57,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:48:57,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:57,963 INFO L87 Difference]: Start difference. First operand has 313 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 245 states have internal predecessors, (378), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:48:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:58,061 INFO L93 Difference]: Finished difference Result 619 states and 1079 transitions. [2025-03-08 15:48:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:48:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 471 [2025-03-08 15:48:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:58,071 INFO L225 Difference]: With dead ends: 619 [2025-03-08 15:48:58,072 INFO L226 Difference]: Without dead ends: 309 [2025-03-08 15:48:58,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:48:58,077 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:58,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 482 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:48:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-08 15:48:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-03-08 15:48:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5269709543568464) internal successors, (368), 241 states have internal predecessors, (368), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:48:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 500 transitions. [2025-03-08 15:48:58,165 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 500 transitions. Word has length 471 [2025-03-08 15:48:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:58,165 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 500 transitions. [2025-03-08 15:48:58,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:48:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 500 transitions. [2025-03-08 15:48:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:48:58,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:58,184 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:58,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:48:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:48:58,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -762670773, now seen corresponding path program 1 times [2025-03-08 15:48:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422817763] [2025-03-08 15:48:58,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:58,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:48:58,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:48:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:48:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:58,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422817763] [2025-03-08 15:48:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422817763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:58,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977354764] [2025-03-08 15:48:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:58,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:58,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:58,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:58,894 INFO L87 Difference]: Start difference. First operand 309 states and 500 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:48:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:59,057 INFO L93 Difference]: Finished difference Result 918 states and 1488 transitions. [2025-03-08 15:48:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:48:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:59,064 INFO L225 Difference]: With dead ends: 918 [2025-03-08 15:48:59,064 INFO L226 Difference]: Without dead ends: 612 [2025-03-08 15:48:59,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:59,066 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 485 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:59,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 935 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-08 15:48:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 423. [2025-03-08 15:48:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 355 states have (on average 1.580281690140845) internal successors, (561), 355 states have internal predecessors, (561), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:48:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 693 transitions. [2025-03-08 15:48:59,117 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 693 transitions. Word has length 471 [2025-03-08 15:48:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:59,120 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 693 transitions. [2025-03-08 15:48:59,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:48:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 693 transitions. [2025-03-08 15:48:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:48:59,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:59,127 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:59,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:48:59,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:59,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1756114419, now seen corresponding path program 1 times [2025-03-08 15:48:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148657729] [2025-03-08 15:48:59,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:59,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:48:59,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:48:59,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:59,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:48:59,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:59,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148657729] [2025-03-08 15:48:59,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148657729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:59,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:59,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:59,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362130206] [2025-03-08 15:48:59,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:59,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:59,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:59,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:59,489 INFO L87 Difference]: Start difference. First operand 423 states and 693 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:48:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:59,668 INFO L93 Difference]: Finished difference Result 1134 states and 1861 transitions. [2025-03-08 15:48:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:48:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:59,676 INFO L225 Difference]: With dead ends: 1134 [2025-03-08 15:48:59,678 INFO L226 Difference]: Without dead ends: 714 [2025-03-08 15:48:59,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:59,680 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 330 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:59,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 931 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-08 15:48:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 711. [2025-03-08 15:48:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 612 states have (on average 1.5898692810457515) internal successors, (973), 613 states have internal predecessors, (973), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 15:48:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1165 transitions. [2025-03-08 15:48:59,724 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1165 transitions. Word has length 471 [2025-03-08 15:48:59,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:59,726 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1165 transitions. [2025-03-08 15:48:59,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:48:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1165 transitions. [2025-03-08 15:48:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:48:59,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:59,734 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:48:59,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2055177550, now seen corresponding path program 1 times [2025-03-08 15:48:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146190331] [2025-03-08 15:48:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:59,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:48:59,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:48:59,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:59,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146190331] [2025-03-08 15:49:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146190331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:49:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154835186] [2025-03-08 15:49:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:00,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:49:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:00,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:49:00,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,119 INFO L87 Difference]: Start difference. First operand 711 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:00,262 INFO L93 Difference]: Finished difference Result 2111 states and 3459 transitions. [2025-03-08 15:49:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:49:00,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:49:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:00,273 INFO L225 Difference]: With dead ends: 2111 [2025-03-08 15:49:00,273 INFO L226 Difference]: Without dead ends: 1403 [2025-03-08 15:49:00,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,276 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 480 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:00,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:49:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-08 15:49:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 831. [2025-03-08 15:49:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 732 states have (on average 1.5887978142076502) internal successors, (1163), 733 states have internal predecessors, (1163), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 15:49:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1355 transitions. [2025-03-08 15:49:00,351 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1355 transitions. Word has length 471 [2025-03-08 15:49:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:00,353 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1355 transitions. [2025-03-08 15:49:00,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1355 transitions. [2025-03-08 15:49:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:49:00,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:00,360 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:00,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:49:00,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -592168146, now seen corresponding path program 1 times [2025-03-08 15:49:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146764812] [2025-03-08 15:49:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:00,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:49:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:49:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:00,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:00,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146764812] [2025-03-08 15:49:00,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146764812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:00,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:00,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:49:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251174764] [2025-03-08 15:49:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:00,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:49:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:49:00,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,619 INFO L87 Difference]: Start difference. First operand 831 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:00,755 INFO L93 Difference]: Finished difference Result 2455 states and 4003 transitions. [2025-03-08 15:49:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:49:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:49:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:00,765 INFO L225 Difference]: With dead ends: 2455 [2025-03-08 15:49:00,765 INFO L226 Difference]: Without dead ends: 1627 [2025-03-08 15:49:00,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:00,768 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 479 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:00,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1273 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:49:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2025-03-08 15:49:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 835. [2025-03-08 15:49:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 736 states have (on average 1.5855978260869565) internal successors, (1167), 737 states have internal predecessors, (1167), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 15:49:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1359 transitions. [2025-03-08 15:49:00,840 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1359 transitions. Word has length 471 [2025-03-08 15:49:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1359 transitions. [2025-03-08 15:49:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1359 transitions. [2025-03-08 15:49:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:49:00,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:00,849 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:00,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:49:00,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1514851729, now seen corresponding path program 1 times [2025-03-08 15:49:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33923210] [2025-03-08 15:49:00,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:49:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:49:00,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:00,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33923210] [2025-03-08 15:49:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33923210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:49:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264926862] [2025-03-08 15:49:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:49:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:01,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:49:01,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:01,135 INFO L87 Difference]: Start difference. First operand 835 states and 1359 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:01,287 INFO L93 Difference]: Finished difference Result 2432 states and 3956 transitions. [2025-03-08 15:49:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:49:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:49:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:01,295 INFO L225 Difference]: With dead ends: 2432 [2025-03-08 15:49:01,295 INFO L226 Difference]: Without dead ends: 1600 [2025-03-08 15:49:01,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:49:01,298 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 339 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:01,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:49:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-03-08 15:49:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1597. [2025-03-08 15:49:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1432 states have (on average 1.579608938547486) internal successors, (2262), 1435 states have internal predecessors, (2262), 160 states have call successors, (160), 4 states have call predecessors, (160), 4 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-08 15:49:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2582 transitions. [2025-03-08 15:49:01,351 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2582 transitions. Word has length 471 [2025-03-08 15:49:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:01,352 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2582 transitions. [2025-03-08 15:49:01,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2582 transitions. [2025-03-08 15:49:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:49:01,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:01,359 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:49:01,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -287861331, now seen corresponding path program 1 times [2025-03-08 15:49:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238881848] [2025-03-08 15:49:01,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:01,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:49:01,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:49:01,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238881848] [2025-03-08 15:49:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238881848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:49:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108573429] [2025-03-08 15:49:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:02,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:49:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:02,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:49:02,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:49:02,725 INFO L87 Difference]: Start difference. First operand 1597 states and 2582 transitions. Second operand has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:06,398 INFO L93 Difference]: Finished difference Result 12898 states and 20762 transitions. [2025-03-08 15:49:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:49:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 471 [2025-03-08 15:49:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:06,439 INFO L225 Difference]: With dead ends: 12898 [2025-03-08 15:49:06,440 INFO L226 Difference]: Without dead ends: 11304 [2025-03-08 15:49:06,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2025-03-08 15:49:06,446 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 2942 mSDsluCounter, 5057 mSDsCounter, 0 mSdLazyCounter, 3635 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 3635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:06,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 6022 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 3635 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 15:49:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2025-03-08 15:49:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 7912. [2025-03-08 15:49:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7912 states, 7241 states have (on average 1.589697555586245) internal successors, (11511), 7266 states have internal predecessors, (11511), 642 states have call successors, (642), 28 states have call predecessors, (642), 28 states have return successors, (642), 617 states have call predecessors, (642), 642 states have call successors, (642) [2025-03-08 15:49:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7912 states to 7912 states and 12795 transitions. [2025-03-08 15:49:06,726 INFO L78 Accepts]: Start accepts. Automaton has 7912 states and 12795 transitions. Word has length 471 [2025-03-08 15:49:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:06,727 INFO L471 AbstractCegarLoop]: Abstraction has 7912 states and 12795 transitions. [2025-03-08 15:49:06,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.090909090909092) internal successors, (144), 11 states have internal predecessors, (144), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7912 states and 12795 transitions. [2025-03-08 15:49:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:49:06,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:06,735 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:06,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:49:06,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:06,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash -528401460, now seen corresponding path program 1 times [2025-03-08 15:49:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:06,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997089853] [2025-03-08 15:49:06,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:06,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:06,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:49:06,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:49:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997089853] [2025-03-08 15:49:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997089853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:49:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476753119] [2025-03-08 15:49:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:49:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:07,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:49:07,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:49:07,409 INFO L87 Difference]: Start difference. First operand 7912 states and 12795 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:49:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:08,136 INFO L93 Difference]: Finished difference Result 23149 states and 37419 transitions. [2025-03-08 15:49:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:49:08,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 471 [2025-03-08 15:49:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:08,250 INFO L225 Difference]: With dead ends: 23149 [2025-03-08 15:49:08,250 INFO L226 Difference]: Without dead ends: 15240 [2025-03-08 15:49:08,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:49:08,260 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 1054 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:08,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2006 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:49:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2025-03-08 15:49:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 11884. [2025-03-08 15:49:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 10873 states have (on average 1.5917410098408902) internal successors, (17307), 10908 states have internal predecessors, (17307), 970 states have call successors, (970), 40 states have call predecessors, (970), 40 states have return successors, (970), 935 states have call predecessors, (970), 970 states have call successors, (970) [2025-03-08 15:49:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 19247 transitions. [2025-03-08 15:49:08,649 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 19247 transitions. Word has length 471 [2025-03-08 15:49:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:08,650 INFO L471 AbstractCegarLoop]: Abstraction has 11884 states and 19247 transitions. [2025-03-08 15:49:08,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:49:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 19247 transitions. [2025-03-08 15:49:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 15:49:08,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:08,663 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:49:08,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:08,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2105429395, now seen corresponding path program 1 times [2025-03-08 15:49:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:08,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968897378] [2025-03-08 15:49:08,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:08,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 15:49:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 15:49:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:08,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968897378] [2025-03-08 15:49:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968897378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:09,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:09,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:49:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124654886] [2025-03-08 15:49:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:09,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:49:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:09,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:49:09,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:49:09,859 INFO L87 Difference]: Start difference. First operand 11884 states and 19247 transitions. Second operand has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:11,415 INFO L93 Difference]: Finished difference Result 30596 states and 49366 transitions. [2025-03-08 15:49:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:49:11,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2025-03-08 15:49:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:11,466 INFO L225 Difference]: With dead ends: 30596 [2025-03-08 15:49:11,466 INFO L226 Difference]: Without dead ends: 22687 [2025-03-08 15:49:11,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:49:11,490 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 2084 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 5597 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:11,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 5597 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:49:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22687 states. [2025-03-08 15:49:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22687 to 17688. [2025-03-08 15:49:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17688 states, 16477 states have (on average 1.5995023365903986) internal successors, (26355), 16527 states have internal predecessors, (26355), 1154 states have call successors, (1154), 56 states have call predecessors, (1154), 56 states have return successors, (1154), 1104 states have call predecessors, (1154), 1154 states have call successors, (1154) [2025-03-08 15:49:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17688 states to 17688 states and 28663 transitions. [2025-03-08 15:49:11,914 INFO L78 Accepts]: Start accepts. Automaton has 17688 states and 28663 transitions. Word has length 472 [2025-03-08 15:49:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 17688 states and 28663 transitions. [2025-03-08 15:49:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 17688 states and 28663 transitions. [2025-03-08 15:49:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 15:49:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:11,931 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:11,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:49:11,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 504544719, now seen corresponding path program 1 times [2025-03-08 15:49:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489769484] [2025-03-08 15:49:11,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 15:49:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 15:49:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:12,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489769484] [2025-03-08 15:49:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489769484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604793467] [2025-03-08 15:49:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:12,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:12,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:12,308 INFO L87 Difference]: Start difference. First operand 17688 states and 28663 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:12,963 INFO L93 Difference]: Finished difference Result 37519 states and 60677 transitions. [2025-03-08 15:49:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2025-03-08 15:49:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:13,020 INFO L225 Difference]: With dead ends: 37519 [2025-03-08 15:49:13,020 INFO L226 Difference]: Without dead ends: 19834 [2025-03-08 15:49:13,054 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-03-08 15:49:13,055 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 614 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:13,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1792 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:49:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2025-03-08 15:49:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 19828. [2025-03-08 15:49:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19828 states, 18287 states have (on average 1.588286761087111) internal successors, (29045), 18353 states have internal predecessors, (29045), 1468 states have call successors, (1468), 72 states have call predecessors, (1468), 72 states have return successors, (1468), 1402 states have call predecessors, (1468), 1468 states have call successors, (1468) [2025-03-08 15:49:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19828 states to 19828 states and 31981 transitions. [2025-03-08 15:49:13,582 INFO L78 Accepts]: Start accepts. Automaton has 19828 states and 31981 transitions. Word has length 472 [2025-03-08 15:49:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:13,583 INFO L471 AbstractCegarLoop]: Abstraction has 19828 states and 31981 transitions. [2025-03-08 15:49:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19828 states and 31981 transitions. [2025-03-08 15:49:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 15:49:13,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:13,601 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:49:13,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:13,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash -997837041, now seen corresponding path program 1 times [2025-03-08 15:49:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15578870] [2025-03-08 15:49:13,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:13,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 15:49:14,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 15:49:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15578870] [2025-03-08 15:49:14,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15578870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:14,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:14,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:49:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295533450] [2025-03-08 15:49:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:14,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:49:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:14,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:49:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:49:14,543 INFO L87 Difference]: Start difference. First operand 19828 states and 31981 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:15,240 INFO L93 Difference]: Finished difference Result 39711 states and 64006 transitions. [2025-03-08 15:49:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:49:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 472 [2025-03-08 15:49:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:15,294 INFO L225 Difference]: With dead ends: 39711 [2025-03-08 15:49:15,294 INFO L226 Difference]: Without dead ends: 19886 [2025-03-08 15:49:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:49:15,325 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 644 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2421 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:49:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2025-03-08 15:49:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 15922. [2025-03-08 15:49:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15922 states, 15020 states have (on average 1.6083888149134487) internal successors, (24158), 15050 states have internal predecessors, (24158), 856 states have call successors, (856), 45 states have call predecessors, (856), 45 states have return successors, (856), 826 states have call predecessors, (856), 856 states have call successors, (856) [2025-03-08 15:49:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15922 states to 15922 states and 25870 transitions. [2025-03-08 15:49:15,722 INFO L78 Accepts]: Start accepts. Automaton has 15922 states and 25870 transitions. Word has length 472 [2025-03-08 15:49:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:15,723 INFO L471 AbstractCegarLoop]: Abstraction has 15922 states and 25870 transitions. [2025-03-08 15:49:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15922 states and 25870 transitions. [2025-03-08 15:49:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:15,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:15,737 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:15,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:49:15,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:15,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -848523858, now seen corresponding path program 1 times [2025-03-08 15:49:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:15,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313517870] [2025-03-08 15:49:15,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:15,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:16,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:16,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:16,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313517870] [2025-03-08 15:49:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313517870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:16,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085256470] [2025-03-08 15:49:16,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:16,702 INFO L87 Difference]: Start difference. First operand 15922 states and 25870 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:17,790 INFO L93 Difference]: Finished difference Result 50697 states and 82023 transitions. [2025-03-08 15:49:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:17,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2025-03-08 15:49:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:17,881 INFO L225 Difference]: With dead ends: 50697 [2025-03-08 15:49:17,881 INFO L226 Difference]: Without dead ends: 34670 [2025-03-08 15:49:17,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 15:49:17,916 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 1009 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:17,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1205 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:49:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34670 states. [2025-03-08 15:49:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34670 to 16078. [2025-03-08 15:49:18,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16078 states, 15176 states have (on average 1.6072746441750132) internal successors, (24392), 15206 states have internal predecessors, (24392), 856 states have call successors, (856), 45 states have call predecessors, (856), 45 states have return successors, (856), 826 states have call predecessors, (856), 856 states have call successors, (856) [2025-03-08 15:49:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 26104 transitions. [2025-03-08 15:49:18,540 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 26104 transitions. Word has length 473 [2025-03-08 15:49:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 16078 states and 26104 transitions. [2025-03-08 15:49:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 26104 transitions. [2025-03-08 15:49:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:18,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:18,554 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:49:18,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash -892894784, now seen corresponding path program 1 times [2025-03-08 15:49:18,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:18,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641343799] [2025-03-08 15:49:18,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:18,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:18,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:18,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:18,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641343799] [2025-03-08 15:49:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641343799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767529049] [2025-03-08 15:49:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:19,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:19,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:19,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:19,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:19,264 INFO L87 Difference]: Start difference. First operand 16078 states and 26104 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:19,596 INFO L93 Difference]: Finished difference Result 32470 states and 52737 transitions. [2025-03-08 15:49:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2025-03-08 15:49:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:19,634 INFO L225 Difference]: With dead ends: 32470 [2025-03-08 15:49:19,635 INFO L226 Difference]: Without dead ends: 16395 [2025-03-08 15:49:19,656 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-03-08 15:49:19,656 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 426 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:19,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1636 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:49:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2025-03-08 15:49:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16078. [2025-03-08 15:49:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16078 states, 15176 states have (on average 1.6054296257248286) internal successors, (24364), 15206 states have internal predecessors, (24364), 856 states have call successors, (856), 45 states have call predecessors, (856), 45 states have return successors, (856), 826 states have call predecessors, (856), 856 states have call successors, (856) [2025-03-08 15:49:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 26076 transitions. [2025-03-08 15:49:20,244 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 26076 transitions. Word has length 473 [2025-03-08 15:49:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:20,245 INFO L471 AbstractCegarLoop]: Abstraction has 16078 states and 26076 transitions. [2025-03-08 15:49:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 26076 transitions. [2025-03-08 15:49:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:20,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:20,274 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:20,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:49:20,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:20,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1126544542, now seen corresponding path program 1 times [2025-03-08 15:49:20,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:20,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67992046] [2025-03-08 15:49:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:20,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:20,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:20,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67992046] [2025-03-08 15:49:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67992046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486428888] [2025-03-08 15:49:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:20,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:20,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:20,996 INFO L87 Difference]: Start difference. First operand 16078 states and 26076 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:21,623 INFO L93 Difference]: Finished difference Result 36023 states and 58230 transitions. [2025-03-08 15:49:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2025-03-08 15:49:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:21,758 INFO L225 Difference]: With dead ends: 36023 [2025-03-08 15:49:21,758 INFO L226 Difference]: Without dead ends: 19948 [2025-03-08 15:49:21,771 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-03-08 15:49:21,771 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 492 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:21,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1912 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:49:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-03-08 15:49:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 12750. [2025-03-08 15:49:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12750 states, 12145 states have (on average 1.5990942774804446) internal successors, (19421), 12157 states have internal predecessors, (19421), 568 states have call successors, (568), 36 states have call predecessors, (568), 36 states have return successors, (568), 556 states have call predecessors, (568), 568 states have call successors, (568) [2025-03-08 15:49:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12750 states to 12750 states and 20557 transitions. [2025-03-08 15:49:22,159 INFO L78 Accepts]: Start accepts. Automaton has 12750 states and 20557 transitions. Word has length 473 [2025-03-08 15:49:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:22,160 INFO L471 AbstractCegarLoop]: Abstraction has 12750 states and 20557 transitions. [2025-03-08 15:49:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12750 states and 20557 transitions. [2025-03-08 15:49:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:22,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:22,170 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:22,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:49:22,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2143728833, now seen corresponding path program 1 times [2025-03-08 15:49:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:22,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315289319] [2025-03-08 15:49:22,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:22,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:22,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:22,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:22,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315289319] [2025-03-08 15:49:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315289319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:49:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287941006] [2025-03-08 15:49:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:49:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:49:22,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:49:22,788 INFO L87 Difference]: Start difference. First operand 12750 states and 20557 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:23,421 INFO L93 Difference]: Finished difference Result 37989 states and 61031 transitions. [2025-03-08 15:49:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:49:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 473 [2025-03-08 15:49:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:23,467 INFO L225 Difference]: With dead ends: 37989 [2025-03-08 15:49:23,467 INFO L226 Difference]: Without dead ends: 25242 [2025-03-08 15:49:23,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 15:49:23,484 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 522 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:23,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1740 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:49:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25242 states. [2025-03-08 15:49:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25242 to 22477. [2025-03-08 15:49:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22477 states, 21539 states have (on average 1.591299503226705) internal successors, (34275), 21569 states have internal predecessors, (34275), 874 states have call successors, (874), 63 states have call predecessors, (874), 63 states have return successors, (874), 844 states have call predecessors, (874), 874 states have call successors, (874) [2025-03-08 15:49:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22477 states to 22477 states and 36023 transitions. [2025-03-08 15:49:24,056 INFO L78 Accepts]: Start accepts. Automaton has 22477 states and 36023 transitions. Word has length 473 [2025-03-08 15:49:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 22477 states and 36023 transitions. [2025-03-08 15:49:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:49:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22477 states and 36023 transitions. [2025-03-08 15:49:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:24,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:24,070 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:24,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:49:24,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:24,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash 213109728, now seen corresponding path program 1 times [2025-03-08 15:49:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441852881] [2025-03-08 15:49:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:24,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:24,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:24,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:49:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:49:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:49:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441852881] [2025-03-08 15:49:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441852881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:49:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:49:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 15:49:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584406760] [2025-03-08 15:49:38,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:49:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:49:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:49:38,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:49:38,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:49:38,631 INFO L87 Difference]: Start difference. First operand 22477 states and 36023 transitions. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-03-08 15:49:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:49:51,341 INFO L93 Difference]: Finished difference Result 66527 states and 106161 transitions. [2025-03-08 15:49:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:49:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) Word has length 473 [2025-03-08 15:49:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:49:51,429 INFO L225 Difference]: With dead ends: 66527 [2025-03-08 15:49:51,429 INFO L226 Difference]: Without dead ends: 51929 [2025-03-08 15:49:51,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 15:49:51,456 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 4925 mSDsluCounter, 4798 mSDsCounter, 0 mSdLazyCounter, 5921 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 5235 SdHoareTripleChecker+Invalid, 6383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 5921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:49:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 5235 Invalid, 6383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 5921 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2025-03-08 15:49:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51929 states. [2025-03-08 15:49:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51929 to 27923. [2025-03-08 15:49:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27923 states, 26833 states have (on average 1.5925166772258041) internal successors, (42732), 26871 states have internal predecessors, (42732), 1010 states have call successors, (1010), 79 states have call predecessors, (1010), 79 states have return successors, (1010), 972 states have call predecessors, (1010), 1010 states have call successors, (1010) [2025-03-08 15:49:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27923 states to 27923 states and 44752 transitions. [2025-03-08 15:49:52,348 INFO L78 Accepts]: Start accepts. Automaton has 27923 states and 44752 transitions. Word has length 473 [2025-03-08 15:49:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:49:52,349 INFO L471 AbstractCegarLoop]: Abstraction has 27923 states and 44752 transitions. [2025-03-08 15:49:52,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-03-08 15:49:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27923 states and 44752 transitions. [2025-03-08 15:49:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:49:52,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:49:52,367 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:49:52,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:49:52,368 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:49:52,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:49:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -631362143, now seen corresponding path program 1 times [2025-03-08 15:49:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:49:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443532389] [2025-03-08 15:49:52,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:49:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:49:52,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:49:54,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:49:54,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:49:54,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat