./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.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-44.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 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:44:20,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:44:20,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:44:20,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:44:20,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:44:20,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:44:20,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:44:20,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:44:20,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:44:20,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:44:20,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:44:20,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:44:20,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:44:20,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:44:20,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:44:20,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:20,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:44:20,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:44:20,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:44:20,573 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 -> 220ce7b7c26744c9904e5fd461259f8f4f4bb30e1410a3523238b4cddd16ae20 [2025-03-08 15:44:20,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:44:20,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:44:20,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:44:20,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:44:20,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:44:20,781 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-44.i [2025-03-08 15:44:21,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df04b9b93/1d05abe99bcd47f4bd799bbd98807462/FLAG667d10ae9 [2025-03-08 15:44:22,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:44:22,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-44.i [2025-03-08 15:44:22,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df04b9b93/1d05abe99bcd47f4bd799bbd98807462/FLAG667d10ae9 [2025-03-08 15:44:22,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df04b9b93/1d05abe99bcd47f4bd799bbd98807462 [2025-03-08 15:44:22,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:44:22,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:44:22,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:22,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:44:22,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:44:22,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:22,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8f1ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22, skipping insertion in model container [2025-03-08 15:44:22,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:22,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:44:22,604 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-44.i[916,929] [2025-03-08 15:44:22,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:22,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:44:22,828 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-44.i[916,929] [2025-03-08 15:44:22,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:22,921 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:44:22,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22 WrapperNode [2025-03-08 15:44:22,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:22,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:22,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:44:22,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:44:22,929 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:44:22" (1/1) ... [2025-03-08 15:44:22,945 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:44:22" (1/1) ... [2025-03-08 15:44:23,006 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 769 [2025-03-08 15:44:23,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:23,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:44:23,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:44:23,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:44:23,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,067 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:44:23,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:44:23,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:44:23,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:44:23,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:44:23,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (1/1) ... [2025-03-08 15:44:23,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:23,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:23,189 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:44:23,192 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:44:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:44:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:44:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:44:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:44:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:44:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:44:23,331 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:44:23,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:44:24,195 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: havoc property_#t~ite46#1;havoc property_#t~bitwise42#1;havoc property_#t~ite45#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short47#1;havoc property_#t~ite54#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~bitwise50#1;havoc property_#t~ite53#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1;havoc property_#t~ite64#1;havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short65#1; [2025-03-08 15:44:24,306 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-08 15:44:24,306 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:44:24,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:44:24,343 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-08 15:44:24,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:24 BoogieIcfgContainer [2025-03-08 15:44:24,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:44:24,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:44:24,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:44:24,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:44:24,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:44:22" (1/3) ... [2025-03-08 15:44:24,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:24, skipping insertion in model container [2025-03-08 15:44:24,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:22" (2/3) ... [2025-03-08 15:44:24,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa2383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:24, skipping insertion in model container [2025-03-08 15:44:24,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:24" (3/3) ... [2025-03-08 15:44:24,350 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-44.i [2025-03-08 15:44:24,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:44:24,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-44.i that has 2 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:44:24,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:44:24,444 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;@6b8ecd31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:44:24,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:44:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:44:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 15:44:24,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:24,463 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:24,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash -846343224, now seen corresponding path program 1 times [2025-03-08 15:44:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895057300] [2025-03-08 15:44:24,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:24,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 15:44:24,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 15:44:24,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:24,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:44:24,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895057300] [2025-03-08 15:44:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895057300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710106868] [2025-03-08 15:44:24,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:24,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:24,984 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:44:24,985 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:44:25,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 15:44:25,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 15:44:25,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:25,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:44:25,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:44:25,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:44:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710106868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:44:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:44:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463024121] [2025-03-08 15:44:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:44:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:25,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:44:25,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:44:25,352 INFO L87 Difference]: Start difference. First operand has 288 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:44:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:25,411 INFO L93 Difference]: Finished difference Result 562 states and 973 transitions. [2025-03-08 15:44:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:44:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 373 [2025-03-08 15:44:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:25,419 INFO L225 Difference]: With dead ends: 562 [2025-03-08 15:44:25,419 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 15:44:25,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 374 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:44:25,425 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:25,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:25,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 15:44:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-08 15:44:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 224 states have internal predecessors, (348), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:44:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 450 transitions. [2025-03-08 15:44:25,481 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 450 transitions. Word has length 373 [2025-03-08 15:44:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:25,482 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 450 transitions. [2025-03-08 15:44:25,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:44:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 450 transitions. [2025-03-08 15:44:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 15:44:25,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:25,492 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:25,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:44:25,696 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:44:25,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:25,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1278535447, now seen corresponding path program 1 times [2025-03-08 15:44:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031243306] [2025-03-08 15:44:25,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:25,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 15:44:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 15:44:25,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:25,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:26,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:26,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031243306] [2025-03-08 15:44:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031243306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749653320] [2025-03-08 15:44:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:26,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:26,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:26,128 INFO L87 Difference]: Start difference. First operand 277 states and 450 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:26,337 INFO L93 Difference]: Finished difference Result 819 states and 1332 transitions. [2025-03-08 15:44:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2025-03-08 15:44:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:26,344 INFO L225 Difference]: With dead ends: 819 [2025-03-08 15:44:26,345 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 15:44:26,346 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:44:26,350 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 422 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1126 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 15:44:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 326. [2025-03-08 15:44:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.586080586080586) internal successors, (433), 273 states have internal predecessors, (433), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:44:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 535 transitions. [2025-03-08 15:44:26,389 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 535 transitions. Word has length 373 [2025-03-08 15:44:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:26,390 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 535 transitions. [2025-03-08 15:44:26,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 535 transitions. [2025-03-08 15:44:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 15:44:26,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:26,394 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:44:26,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:26,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1182298985, now seen corresponding path program 1 times [2025-03-08 15:44:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:26,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289146520] [2025-03-08 15:44:26,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:26,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 15:44:26,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 15:44:26,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:26,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289146520] [2025-03-08 15:44:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289146520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:26,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:26,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:26,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52156223] [2025-03-08 15:44:26,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:26,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:26,721 INFO L87 Difference]: Start difference. First operand 326 states and 535 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:26,828 INFO L93 Difference]: Finished difference Result 868 states and 1414 transitions. [2025-03-08 15:44:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 373 [2025-03-08 15:44:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:26,836 INFO L225 Difference]: With dead ends: 868 [2025-03-08 15:44:26,836 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 15:44:26,837 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:44:26,838 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 426 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:26,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 968 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 15:44:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 326. [2025-03-08 15:44:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.575091575091575) internal successors, (430), 273 states have internal predecessors, (430), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:44:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 532 transitions. [2025-03-08 15:44:26,855 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 532 transitions. Word has length 373 [2025-03-08 15:44:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:26,856 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 532 transitions. [2025-03-08 15:44:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 532 transitions. [2025-03-08 15:44:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:44:26,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:26,862 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:26,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:44:26,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1620140790, now seen corresponding path program 1 times [2025-03-08 15:44:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156974315] [2025-03-08 15:44:26,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:26,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:44:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:44:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156974315] [2025-03-08 15:44:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156974315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087448937] [2025-03-08 15:44:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:27,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:27,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:27,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:27,555 INFO L87 Difference]: Start difference. First operand 326 states and 532 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:27,654 INFO L93 Difference]: Finished difference Result 972 states and 1590 transitions. [2025-03-08 15:44:27,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-03-08 15:44:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:27,659 INFO L225 Difference]: With dead ends: 972 [2025-03-08 15:44:27,660 INFO L226 Difference]: Without dead ends: 649 [2025-03-08 15:44:27,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:44:27,661 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 383 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:27,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 853 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-08 15:44:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2025-03-08 15:44:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 542 states have (on average 1.5756457564575646) internal successors, (854), 542 states have internal predecessors, (854), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:44:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1058 transitions. [2025-03-08 15:44:27,705 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1058 transitions. Word has length 374 [2025-03-08 15:44:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 1058 transitions. [2025-03-08 15:44:27,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1058 transitions. [2025-03-08 15:44:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:44:27,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:27,711 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:27,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:44:27,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:27,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1321516809, now seen corresponding path program 1 times [2025-03-08 15:44:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568836417] [2025-03-08 15:44:27,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:27,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:27,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:44:27,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:44:27,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:27,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568836417] [2025-03-08 15:44:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568836417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419903991] [2025-03-08 15:44:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:28,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:28,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:28,726 INFO L87 Difference]: Start difference. First operand 647 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:29,145 INFO L93 Difference]: Finished difference Result 1840 states and 3014 transitions. [2025-03-08 15:44:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-03-08 15:44:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:29,154 INFO L225 Difference]: With dead ends: 1840 [2025-03-08 15:44:29,154 INFO L226 Difference]: Without dead ends: 1196 [2025-03-08 15:44:29,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:44:29,157 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 389 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:29,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1984 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-03-08 15:44:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 774. [2025-03-08 15:44:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 617 states have (on average 1.5559157212317667) internal successors, (960), 617 states have internal predecessors, (960), 153 states have call successors, (153), 3 states have call predecessors, (153), 3 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 15:44:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1266 transitions. [2025-03-08 15:44:29,223 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1266 transitions. Word has length 374 [2025-03-08 15:44:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:29,224 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1266 transitions. [2025-03-08 15:44:29,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1266 transitions. [2025-03-08 15:44:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:44:29,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:29,229 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:29,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:44:29,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:29,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 864417238, now seen corresponding path program 1 times [2025-03-08 15:44:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636936590] [2025-03-08 15:44:29,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:29,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:44:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:44:29,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:29,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:29,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636936590] [2025-03-08 15:44:29,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636936590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:29,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:29,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205204537] [2025-03-08 15:44:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:29,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:29,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:29,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:29,940 INFO L87 Difference]: Start difference. First operand 774 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:30,369 INFO L93 Difference]: Finished difference Result 2565 states and 4206 transitions. [2025-03-08 15:44:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 374 [2025-03-08 15:44:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:30,378 INFO L225 Difference]: With dead ends: 2565 [2025-03-08 15:44:30,378 INFO L226 Difference]: Without dead ends: 1884 [2025-03-08 15:44:30,380 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:44:30,381 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 713 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:30,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1436 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2025-03-08 15:44:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1434. [2025-03-08 15:44:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1173 states have (on average 1.5643648763853368) internal successors, (1835), 1173 states have internal predecessors, (1835), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-08 15:44:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2345 transitions. [2025-03-08 15:44:30,484 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2345 transitions. Word has length 374 [2025-03-08 15:44:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2345 transitions. [2025-03-08 15:44:30,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2345 transitions. [2025-03-08 15:44:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 15:44:30,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:30,490 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:30,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:44:30,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:30,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:30,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2092762899, now seen corresponding path program 1 times [2025-03-08 15:44:30,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:30,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467409869] [2025-03-08 15:44:30,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:44:30,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:44:30,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:30,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467409869] [2025-03-08 15:44:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467409869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:31,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770500509] [2025-03-08 15:44:31,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:31,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:31,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:31,496 INFO L87 Difference]: Start difference. First operand 1434 states and 2345 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:31,823 INFO L93 Difference]: Finished difference Result 3810 states and 6251 transitions. [2025-03-08 15:44:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 375 [2025-03-08 15:44:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:31,833 INFO L225 Difference]: With dead ends: 3810 [2025-03-08 15:44:31,833 INFO L226 Difference]: Without dead ends: 2472 [2025-03-08 15:44:31,836 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:44:31,837 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 442 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:31,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1362 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-03-08 15:44:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1606. [2025-03-08 15:44:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1345 states have (on average 1.5739776951672861) internal successors, (2117), 1345 states have internal predecessors, (2117), 255 states have call successors, (255), 5 states have call predecessors, (255), 5 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-08 15:44:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2627 transitions. [2025-03-08 15:44:31,946 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2627 transitions. Word has length 375 [2025-03-08 15:44:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2627 transitions. [2025-03-08 15:44:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2627 transitions. [2025-03-08 15:44:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-08 15:44:31,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:31,950 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:31,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:44:31,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:31,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1785773781, now seen corresponding path program 1 times [2025-03-08 15:44:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487303360] [2025-03-08 15:44:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:31,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 15:44:32,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 15:44:32,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:32,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487303360] [2025-03-08 15:44:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487303360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:32,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:32,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536897673] [2025-03-08 15:44:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:32,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:32,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:32,870 INFO L87 Difference]: Start difference. First operand 1606 states and 2627 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:33,069 INFO L93 Difference]: Finished difference Result 3922 states and 6375 transitions. [2025-03-08 15:44:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-03-08 15:44:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:33,082 INFO L225 Difference]: With dead ends: 3922 [2025-03-08 15:44:33,082 INFO L226 Difference]: Without dead ends: 2596 [2025-03-08 15:44:33,086 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:44:33,086 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 779 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:33,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 845 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2025-03-08 15:44:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2358. [2025-03-08 15:44:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 2093 states have (on average 1.6000955566172959) internal successors, (3349), 2093 states have internal predecessors, (3349), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-08 15:44:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3859 transitions. [2025-03-08 15:44:33,215 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3859 transitions. Word has length 376 [2025-03-08 15:44:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:33,215 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3859 transitions. [2025-03-08 15:44:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3859 transitions. [2025-03-08 15:44:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-08 15:44:33,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:33,220 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:44:33,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1419653941, now seen corresponding path program 1 times [2025-03-08 15:44:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406859505] [2025-03-08 15:44:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:33,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 15:44:33,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 15:44:33,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:33,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406859505] [2025-03-08 15:44:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406859505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:33,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913043969] [2025-03-08 15:44:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:33,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:33,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:33,373 INFO L87 Difference]: Start difference. First operand 2358 states and 3859 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:33,513 INFO L93 Difference]: Finished difference Result 5770 states and 9429 transitions. [2025-03-08 15:44:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-03-08 15:44:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:33,530 INFO L225 Difference]: With dead ends: 5770 [2025-03-08 15:44:33,530 INFO L226 Difference]: Without dead ends: 3780 [2025-03-08 15:44:33,535 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:44:33,535 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 430 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:33,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1057 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2025-03-08 15:44:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2510. [2025-03-08 15:44:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2245 states have (on average 1.5844097995545656) internal successors, (3557), 2245 states have internal predecessors, (3557), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-08 15:44:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 4067 transitions. [2025-03-08 15:44:33,655 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 4067 transitions. Word has length 376 [2025-03-08 15:44:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:33,655 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 4067 transitions. [2025-03-08 15:44:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 4067 transitions. [2025-03-08 15:44:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-08 15:44:33,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:33,660 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:44:33,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:33,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2113046646, now seen corresponding path program 1 times [2025-03-08 15:44:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404203408] [2025-03-08 15:44:33,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:33,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-08 15:44:33,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-08 15:44:33,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404203408] [2025-03-08 15:44:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404203408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910841076] [2025-03-08 15:44:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:34,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:34,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:34,689 INFO L87 Difference]: Start difference. First operand 2510 states and 4067 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:35,299 INFO L93 Difference]: Finished difference Result 6214 states and 10135 transitions. [2025-03-08 15:44:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 376 [2025-03-08 15:44:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:35,319 INFO L225 Difference]: With dead ends: 6214 [2025-03-08 15:44:35,319 INFO L226 Difference]: Without dead ends: 4020 [2025-03-08 15:44:35,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:44:35,326 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 393 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:35,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1579 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2025-03-08 15:44:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 2510. [2025-03-08 15:44:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 2245 states have (on average 1.5835189309576838) internal successors, (3555), 2245 states have internal predecessors, (3555), 255 states have call successors, (255), 9 states have call predecessors, (255), 9 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-08 15:44:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 4065 transitions. [2025-03-08 15:44:35,491 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 4065 transitions. Word has length 376 [2025-03-08 15:44:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:35,491 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 4065 transitions. [2025-03-08 15:44:35,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 4065 transitions. [2025-03-08 15:44:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:35,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:35,498 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:35,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:44:35,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:35,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash -713601046, now seen corresponding path program 1 times [2025-03-08 15:44:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246157475] [2025-03-08 15:44:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:35,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:35,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246157475] [2025-03-08 15:44:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246157475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787819012] [2025-03-08 15:44:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:36,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:36,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:36,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:36,229 INFO L87 Difference]: Start difference. First operand 2510 states and 4065 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:36,593 INFO L93 Difference]: Finished difference Result 6266 states and 10203 transitions. [2025-03-08 15:44:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:36,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-03-08 15:44:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:36,615 INFO L225 Difference]: With dead ends: 6266 [2025-03-08 15:44:36,615 INFO L226 Difference]: Without dead ends: 4284 [2025-03-08 15:44:36,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:44:36,621 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 809 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:36,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 919 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2025-03-08 15:44:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3762. [2025-03-08 15:44:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 3473 states have (on average 1.602936942124964) internal successors, (5567), 3477 states have internal predecessors, (5567), 271 states have call successors, (271), 17 states have call predecessors, (271), 17 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 6109 transitions. [2025-03-08 15:44:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 6109 transitions. Word has length 377 [2025-03-08 15:44:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:36,772 INFO L471 AbstractCegarLoop]: Abstraction has 3762 states and 6109 transitions. [2025-03-08 15:44:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 6109 transitions. [2025-03-08 15:44:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:36,780 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:36,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:44:36,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:36,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash -61490711, now seen corresponding path program 1 times [2025-03-08 15:44:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:36,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735017662] [2025-03-08 15:44:36,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:36,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:37,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:37,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:37,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735017662] [2025-03-08 15:44:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735017662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:37,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293050029] [2025-03-08 15:44:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:37,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:37,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:37,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:37,355 INFO L87 Difference]: Start difference. First operand 3762 states and 6109 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:37,730 INFO L93 Difference]: Finished difference Result 11742 states and 18788 transitions. [2025-03-08 15:44:37,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:37,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-03-08 15:44:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:37,766 INFO L225 Difference]: With dead ends: 11742 [2025-03-08 15:44:37,767 INFO L226 Difference]: Without dead ends: 8136 [2025-03-08 15:44:37,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:44:37,778 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1135 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:37,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1502 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8136 states. [2025-03-08 15:44:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8136 to 4098. [2025-03-08 15:44:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 3808 states have (on average 1.5824579831932772) internal successors, (6026), 3812 states have internal predecessors, (6026), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6568 transitions. [2025-03-08 15:44:37,990 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6568 transitions. Word has length 377 [2025-03-08 15:44:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 6568 transitions. [2025-03-08 15:44:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6568 transitions. [2025-03-08 15:44:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:37,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:37,998 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:37,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:44:37,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:37,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1460752107, now seen corresponding path program 1 times [2025-03-08 15:44:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869417296] [2025-03-08 15:44:37,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:38,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:38,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:38,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:38,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:38,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869417296] [2025-03-08 15:44:38,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869417296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:38,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:38,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:38,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222756838] [2025-03-08 15:44:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:38,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:38,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:38,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:38,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:38,686 INFO L87 Difference]: Start difference. First operand 4098 states and 6568 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:39,112 INFO L93 Difference]: Finished difference Result 8972 states and 14293 transitions. [2025-03-08 15:44:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-03-08 15:44:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:39,128 INFO L225 Difference]: With dead ends: 8972 [2025-03-08 15:44:39,128 INFO L226 Difference]: Without dead ends: 5530 [2025-03-08 15:44:39,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:39,137 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 587 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:39,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1381 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2025-03-08 15:44:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 4106. [2025-03-08 15:44:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4106 states, 3816 states have (on average 1.5812368972746331) internal successors, (6034), 3820 states have internal predecessors, (6034), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 6576 transitions. [2025-03-08 15:44:39,321 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 6576 transitions. Word has length 377 [2025-03-08 15:44:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:39,322 INFO L471 AbstractCegarLoop]: Abstraction has 4106 states and 6576 transitions. [2025-03-08 15:44:39,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 6576 transitions. [2025-03-08 15:44:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:39,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:39,328 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:44:39,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1764075246, now seen corresponding path program 1 times [2025-03-08 15:44:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570479677] [2025-03-08 15:44:39,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:39,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570479677] [2025-03-08 15:44:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570479677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347683282] [2025-03-08 15:44:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:39,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:39,451 INFO L87 Difference]: Start difference. First operand 4106 states and 6576 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:39,598 INFO L93 Difference]: Finished difference Result 9078 states and 14628 transitions. [2025-03-08 15:44:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:39,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-03-08 15:44:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:39,610 INFO L225 Difference]: With dead ends: 9078 [2025-03-08 15:44:39,610 INFO L226 Difference]: Without dead ends: 5628 [2025-03-08 15:44:39,616 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:44:39,617 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 148 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:39,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 897 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2025-03-08 15:44:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 4530. [2025-03-08 15:44:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4530 states, 4240 states have (on average 1.5929245283018867) internal successors, (6754), 4244 states have internal predecessors, (6754), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 7296 transitions. [2025-03-08 15:44:39,754 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 7296 transitions. Word has length 377 [2025-03-08 15:44:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:39,755 INFO L471 AbstractCegarLoop]: Abstraction has 4530 states and 7296 transitions. [2025-03-08 15:44:39,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 7296 transitions. [2025-03-08 15:44:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:39,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:39,762 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:44:39,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:39,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash 767002893, now seen corresponding path program 1 times [2025-03-08 15:44:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:39,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545027121] [2025-03-08 15:44:39,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:40,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:40,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:40,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545027121] [2025-03-08 15:44:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545027121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:40,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805037727] [2025-03-08 15:44:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:40,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:40,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:40,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:40,472 INFO L87 Difference]: Start difference. First operand 4530 states and 7296 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:40,803 INFO L93 Difference]: Finished difference Result 11593 states and 18736 transitions. [2025-03-08 15:44:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 377 [2025-03-08 15:44:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:40,823 INFO L225 Difference]: With dead ends: 11593 [2025-03-08 15:44:40,823 INFO L226 Difference]: Without dead ends: 7719 [2025-03-08 15:44:40,833 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:44:40,833 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 716 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:40,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1112 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2025-03-08 15:44:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 7023. [2025-03-08 15:44:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 6733 states have (on average 1.6160701024803208) internal successors, (10881), 6737 states have internal predecessors, (10881), 271 states have call successors, (271), 18 states have call predecessors, (271), 18 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 11423 transitions. [2025-03-08 15:44:40,998 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 11423 transitions. Word has length 377 [2025-03-08 15:44:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:40,999 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 11423 transitions. [2025-03-08 15:44:40,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 11423 transitions. [2025-03-08 15:44:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 15:44:41,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:41,010 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:44:41,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2120312590, now seen corresponding path program 1 times [2025-03-08 15:44:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:41,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496177176] [2025-03-08 15:44:41,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:41,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:41,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-08 15:44:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496177176] [2025-03-08 15:44:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496177176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997086878] [2025-03-08 15:44:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:41,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:41,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:44:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 15:44:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 15:44:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:42,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:42,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 15:44:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2600 proven. 75 refuted. 0 times theorem prover too weak. 2425 trivial. 0 not checked. [2025-03-08 15:44:42,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 75 proven. 75 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-08 15:44:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997086878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:42,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-08 15:44:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185466361] [2025-03-08 15:44:42,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:42,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:44:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:42,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:44:42,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:44:42,719 INFO L87 Difference]: Start difference. First operand 7023 states and 11423 transitions. Second operand has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) [2025-03-08 15:44:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:43,959 INFO L93 Difference]: Finished difference Result 17609 states and 28695 transitions. [2025-03-08 15:44:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:44:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) Word has length 377 [2025-03-08 15:44:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:43,985 INFO L225 Difference]: With dead ends: 17609 [2025-03-08 15:44:43,985 INFO L226 Difference]: Without dead ends: 11655 [2025-03-08 15:44:43,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:44:43,994 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1217 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:43,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 2421 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:44:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11655 states. [2025-03-08 15:44:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11655 to 9485. [2025-03-08 15:44:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9485 states, 9181 states have (on average 1.595795664960244) internal successors, (14651), 9185 states have internal predecessors, (14651), 271 states have call successors, (271), 32 states have call predecessors, (271), 32 states have return successors, (271), 267 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 15:44:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9485 states to 9485 states and 15193 transitions. [2025-03-08 15:44:44,304 INFO L78 Accepts]: Start accepts. Automaton has 9485 states and 15193 transitions. Word has length 377 [2025-03-08 15:44:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 9485 states and 15193 transitions. [2025-03-08 15:44:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.09090909090909) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 4 states have call predecessors, (128), 4 states have call successors, (128) [2025-03-08 15:44:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 9485 states and 15193 transitions. [2025-03-08 15:44:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:44:44,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:44,320 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:44:44,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:44:44,521 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:44,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1237605188, now seen corresponding path program 1 times [2025-03-08 15:44:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385609017] [2025-03-08 15:44:44,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:44:44,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:44:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:45,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:45,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385609017] [2025-03-08 15:44:45,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385609017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:45,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:45,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:44:45,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065955094] [2025-03-08 15:44:45,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:45,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:44:45,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:45,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:44:45,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:44:45,255 INFO L87 Difference]: Start difference. First operand 9485 states and 15193 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:45,875 INFO L93 Difference]: Finished difference Result 26460 states and 42241 transitions. [2025-03-08 15:44:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:44:45,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-03-08 15:44:45,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:45,906 INFO L225 Difference]: With dead ends: 26460 [2025-03-08 15:44:45,906 INFO L226 Difference]: Without dead ends: 17399 [2025-03-08 15:44:45,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:44:45,915 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 953 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:45,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 2411 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2025-03-08 15:44:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 12861. [2025-03-08 15:44:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12861 states, 12513 states have (on average 1.5824342683609047) internal successors, (19801), 12521 states have internal predecessors, (19801), 301 states have call successors, (301), 46 states have call predecessors, (301), 46 states have return successors, (301), 293 states have call predecessors, (301), 301 states have call successors, (301) [2025-03-08 15:44:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12861 states to 12861 states and 20403 transitions. [2025-03-08 15:44:46,291 INFO L78 Accepts]: Start accepts. Automaton has 12861 states and 20403 transitions. Word has length 378 [2025-03-08 15:44:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:46,291 INFO L471 AbstractCegarLoop]: Abstraction has 12861 states and 20403 transitions. [2025-03-08 15:44:46,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 12861 states and 20403 transitions. [2025-03-08 15:44:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:44:46,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:46,310 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:44:46,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:46,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash 212911267, now seen corresponding path program 1 times [2025-03-08 15:44:46,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:46,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210717911] [2025-03-08 15:44:46,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:46,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:44:46,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:44:46,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:46,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:47,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210717911] [2025-03-08 15:44:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210717911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:47,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:44:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692836171] [2025-03-08 15:44:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:44:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:47,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:44:47,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:44:47,199 INFO L87 Difference]: Start difference. First operand 12861 states and 20403 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:51,480 INFO L93 Difference]: Finished difference Result 102766 states and 163162 transitions. [2025-03-08 15:44:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:44:51,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-03-08 15:44:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:51,676 INFO L225 Difference]: With dead ends: 102766 [2025-03-08 15:44:51,676 INFO L226 Difference]: Without dead ends: 91190 [2025-03-08 15:44:51,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-03-08 15:44:51,714 INFO L435 NwaCegarLoop]: 1968 mSDtfsCounter, 4117 mSDsluCounter, 6684 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 940 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 8652 SdHoareTripleChecker+Invalid, 3814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 940 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:51,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 8652 Invalid, 3814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [940 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 15:44:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91190 states. [2025-03-08 15:44:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91190 to 42244. [2025-03-08 15:44:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42244 states, 41015 states have (on average 1.5768377422894062) internal successors, (64674), 41051 states have internal predecessors, (64674), 1047 states have call successors, (1047), 181 states have call predecessors, (1047), 181 states have return successors, (1047), 1011 states have call predecessors, (1047), 1047 states have call successors, (1047) [2025-03-08 15:44:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42244 states to 42244 states and 66768 transitions. [2025-03-08 15:44:52,921 INFO L78 Accepts]: Start accepts. Automaton has 42244 states and 66768 transitions. Word has length 378 [2025-03-08 15:44:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:52,922 INFO L471 AbstractCegarLoop]: Abstraction has 42244 states and 66768 transitions. [2025-03-08 15:44:52,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42244 states and 66768 transitions. [2025-03-08 15:44:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:44:52,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:52,951 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:44:52,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2011681437, now seen corresponding path program 1 times [2025-03-08 15:44:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503127377] [2025-03-08 15:44:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:44:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:44:52,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:52,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503127377] [2025-03-08 15:44:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503127377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094315144] [2025-03-08 15:44:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:53,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:53,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:53,073 INFO L87 Difference]: Start difference. First operand 42244 states and 66768 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:53,708 INFO L93 Difference]: Finished difference Result 81754 states and 129203 transitions. [2025-03-08 15:44:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-03-08 15:44:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:53,779 INFO L225 Difference]: With dead ends: 81754 [2025-03-08 15:44:53,779 INFO L226 Difference]: Without dead ends: 40315 [2025-03-08 15:44:53,815 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:44:53,815 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 310 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:53,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 943 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40315 states. [2025-03-08 15:44:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40315 to 38282. [2025-03-08 15:44:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38282 states, 37172 states have (on average 1.5754600236737328) internal successors, (58563), 37196 states have internal predecessors, (58563), 957 states have call successors, (957), 152 states have call predecessors, (957), 152 states have return successors, (957), 933 states have call predecessors, (957), 957 states have call successors, (957) [2025-03-08 15:44:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38282 states to 38282 states and 60477 transitions. [2025-03-08 15:44:54,946 INFO L78 Accepts]: Start accepts. Automaton has 38282 states and 60477 transitions. Word has length 378 [2025-03-08 15:44:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:54,946 INFO L471 AbstractCegarLoop]: Abstraction has 38282 states and 60477 transitions. [2025-03-08 15:44:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 38282 states and 60477 transitions. [2025-03-08 15:44:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:44:54,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:54,976 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:54,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:44:54,976 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1637466211, now seen corresponding path program 1 times [2025-03-08 15:44:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444423619] [2025-03-08 15:44:54,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:55,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:44:55,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:44:55,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:55,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:44:55,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:55,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444423619] [2025-03-08 15:44:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444423619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298474520] [2025-03-08 15:44:55,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:55,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:55,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:55,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:55,826 INFO L87 Difference]: Start difference. First operand 38282 states and 60477 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:56,624 INFO L93 Difference]: Finished difference Result 68673 states and 108486 transitions. [2025-03-08 15:44:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-03-08 15:44:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:56,692 INFO L225 Difference]: With dead ends: 68673 [2025-03-08 15:44:56,693 INFO L226 Difference]: Without dead ends: 44688 [2025-03-08 15:44:56,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:56,721 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 662 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:56,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1455 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44688 states. [2025-03-08 15:44:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44688 to 38312. [2025-03-08 15:44:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38312 states, 37202 states have (on average 1.574995967958712) internal successors, (58593), 37226 states have internal predecessors, (58593), 957 states have call successors, (957), 152 states have call predecessors, (957), 152 states have return successors, (957), 933 states have call predecessors, (957), 957 states have call successors, (957) [2025-03-08 15:44:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38312 states to 38312 states and 60507 transitions. [2025-03-08 15:44:57,526 INFO L78 Accepts]: Start accepts. Automaton has 38312 states and 60507 transitions. Word has length 378 [2025-03-08 15:44:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 38312 states and 60507 transitions. [2025-03-08 15:44:57,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:44:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38312 states and 60507 transitions. [2025-03-08 15:44:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:44:57,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:57,550 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:57,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 15:44:57,550 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash -526934674, now seen corresponding path program 1 times [2025-03-08 15:44:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722090233] [2025-03-08 15:44:57,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:57,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:44:57,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:44:57,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:57,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:45:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722090233] [2025-03-08 15:45:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722090233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:00,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:00,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:45:00,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186792388] [2025-03-08 15:45:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:00,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:45:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:00,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:45:00,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:45:00,407 INFO L87 Difference]: Start difference. First operand 38312 states and 60507 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:45:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:07,473 INFO L93 Difference]: Finished difference Result 183226 states and 288796 transitions. [2025-03-08 15:45:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:45:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 378 [2025-03-08 15:45:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:07,784 INFO L225 Difference]: With dead ends: 183226 [2025-03-08 15:45:07,784 INFO L226 Difference]: Without dead ends: 159211 [2025-03-08 15:45:07,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:45:07,848 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 3649 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 3232 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3649 SdHoareTripleChecker+Valid, 6148 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 3232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:07,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3649 Valid, 6148 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 3232 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 15:45:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159211 states. [2025-03-08 15:45:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159211 to 104965. [2025-03-08 15:45:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104965 states, 101951 states have (on average 1.5792684721091506) internal successors, (161008), 102039 states have internal predecessors, (161008), 2547 states have call successors, (2547), 466 states have call predecessors, (2547), 466 states have return successors, (2547), 2459 states have call predecessors, (2547), 2547 states have call successors, (2547) [2025-03-08 15:45:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104965 states to 104965 states and 166102 transitions. [2025-03-08 15:45:10,444 INFO L78 Accepts]: Start accepts. Automaton has 104965 states and 166102 transitions. Word has length 378 [2025-03-08 15:45:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:10,444 INFO L471 AbstractCegarLoop]: Abstraction has 104965 states and 166102 transitions. [2025-03-08 15:45:10,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:45:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 104965 states and 166102 transitions. [2025-03-08 15:45:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:45:10,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:10,488 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:45:10,488 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -88925171, now seen corresponding path program 1 times [2025-03-08 15:45:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155939172] [2025-03-08 15:45:10,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:45:10,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:45:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:45:11,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155939172] [2025-03-08 15:45:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155939172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:45:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065664793] [2025-03-08 15:45:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:45:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:11,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:45:11,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:11,747 INFO L87 Difference]: Start difference. First operand 104965 states and 166102 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:45:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:16,072 INFO L93 Difference]: Finished difference Result 280345 states and 444596 transitions. [2025-03-08 15:45:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:45:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 378 [2025-03-08 15:45:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:16,458 INFO L225 Difference]: With dead ends: 280345 [2025-03-08 15:45:16,458 INFO L226 Difference]: Without dead ends: 207001 [2025-03-08 15:45:16,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:16,563 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 1564 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:16,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 2525 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:45:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207001 states. [2025-03-08 15:45:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207001 to 171433. [2025-03-08 15:45:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171433 states, 167261 states have (on average 1.586891146172748) internal successors, (265425), 167377 states have internal predecessors, (265425), 3535 states have call successors, (3535), 636 states have call predecessors, (3535), 636 states have return successors, (3535), 3419 states have call predecessors, (3535), 3535 states have call successors, (3535) [2025-03-08 15:45:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171433 states to 171433 states and 272495 transitions. [2025-03-08 15:45:21,179 INFO L78 Accepts]: Start accepts. Automaton has 171433 states and 272495 transitions. Word has length 378 [2025-03-08 15:45:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:21,180 INFO L471 AbstractCegarLoop]: Abstraction has 171433 states and 272495 transitions. [2025-03-08 15:45:21,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:45:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 171433 states and 272495 transitions. [2025-03-08 15:45:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-08 15:45:21,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:21,263 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:21,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 15:45:21,264 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:21,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash 166458031, now seen corresponding path program 1 times [2025-03-08 15:45:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:21,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329203587] [2025-03-08 15:45:21,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:21,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-08 15:45:21,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-08 15:45:21,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:21,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat