./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-82.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 17ab865f0f00c0e81e7df8c769539048861e387663f5be28b491c6160e2a443b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:36:57,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:36:57,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:36:57,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:36:57,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:36:57,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:36:57,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:36:57,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:36:57,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:36:57,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:36:57,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:36:57,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:36:57,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:36:57,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:36:57,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:36:57,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:36:57,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:36:57,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:36:57,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:36:57,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:36:57,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:57,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:36:57,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:36:57,178 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 -> 17ab865f0f00c0e81e7df8c769539048861e387663f5be28b491c6160e2a443b [2025-03-04 00:36:57,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:36:57,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:36:57,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:36:57,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:36:57,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:36:57,463 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-82.i [2025-03-04 00:36:58,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac158b1/14916abf9190492586498d6eaec4b79f/FLAG6b79a7ca7 [2025-03-04 00:36:59,072 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:36:59,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-82.i [2025-03-04 00:36:59,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac158b1/14916abf9190492586498d6eaec4b79f/FLAG6b79a7ca7 [2025-03-04 00:36:59,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13ac158b1/14916abf9190492586498d6eaec4b79f [2025-03-04 00:36:59,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:36:59,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:36:59,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:59,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:36:59,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:36:59,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:36:59,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59dd3d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59, skipping insertion in model container [2025-03-04 00:36:59,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:36:59,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:36:59,507 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-82.i[916,929] [2025-03-04 00:36:59,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:59,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:36:59,699 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-82.i[916,929] [2025-03-04 00:36:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:59,815 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:36:59,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59 WrapperNode [2025-03-04 00:36:59,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:59,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:59,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:36:59,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:36:59,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:36:59,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:36:59,959 INFO L138 Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 719 [2025-03-04 00:36:59,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:59,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:36:59,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:36:59,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:36:59,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:36:59,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,129 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-04 00:37:00,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:37:00,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:37:00,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:37:00,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:37:00,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (1/1) ... [2025-03-04 00:37:00,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:00,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:00,258 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-04 00:37:00,268 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-04 00:37:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:37:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:37:00,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:37:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:37:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:37:00,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:37:00,431 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:37:00,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:37:01,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L610: havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short50#1;havoc property_#t~ite53#1;havoc property_#t~ite52#1;havoc property_#t~bitwise51#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~ite65#1;havoc property_#t~ite64#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short66#1; [2025-03-04 00:37:01,578 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 00:37:01,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:37:01,607 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:37:01,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:37:01,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:01 BoogieIcfgContainer [2025-03-04 00:37:01,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:37:01,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:37:01,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:37:01,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:37:01,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:59" (1/3) ... [2025-03-04 00:37:01,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd0558c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:01, skipping insertion in model container [2025-03-04 00:37:01,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:59" (2/3) ... [2025-03-04 00:37:01,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd0558c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:01, skipping insertion in model container [2025-03-04 00:37:01,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:01" (3/3) ... [2025-03-04 00:37:01,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-82.i [2025-03-04 00:37:01,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:37:01,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-82.i that has 2 procedures, 293 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:37:01,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:37:01,689 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;@5f8148ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:37:01,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:37:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 226 states have (on average 1.5575221238938053) internal successors, (352), 227 states have internal predecessors, (352), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 00:37:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-04 00:37:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:01,719 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:01,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash -670966499, now seen corresponding path program 1 times [2025-03-04 00:37:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506585014] [2025-03-04 00:37:01,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:01,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 00:37:01,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 00:37:01,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:01,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-04 00:37:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506585014] [2025-03-04 00:37:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506585014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830482499] [2025-03-04 00:37:02,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:02,250 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-04 00:37:02,252 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-04 00:37:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 00:37:02,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 00:37:02,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:02,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:02,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:37:02,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-04 00:37:02,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:37:02,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830482499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:02,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:37:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:37:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030983756] [2025-03-04 00:37:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:02,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:37:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:02,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:37:02,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:37:02,638 INFO L87 Difference]: Start difference. First operand has 293 states, 226 states have (on average 1.5575221238938053) internal successors, (352), 227 states have internal predecessors, (352), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:37:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:02,701 INFO L93 Difference]: Finished difference Result 579 states and 1017 transitions. [2025-03-04 00:37:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:37:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 442 [2025-03-04 00:37:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:02,712 INFO L225 Difference]: With dead ends: 579 [2025-03-04 00:37:02,712 INFO L226 Difference]: Without dead ends: 289 [2025-03-04 00:37:02,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 443 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-04 00:37:02,721 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:37:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-04 00:37:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-04 00:37:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 223 states have (on average 1.5426008968609866) internal successors, (344), 223 states have internal predecessors, (344), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 00:37:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 472 transitions. [2025-03-04 00:37:02,786 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 472 transitions. Word has length 442 [2025-03-04 00:37:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:02,787 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 472 transitions. [2025-03-04 00:37:02,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:37:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 472 transitions. [2025-03-04 00:37:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-04 00:37:02,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:02,794 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:02,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:37:02,995 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-04 00:37:02,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -778396263, now seen corresponding path program 1 times [2025-03-04 00:37:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979433920] [2025-03-04 00:37:02,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 00:37:03,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 00:37:03,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979433920] [2025-03-04 00:37:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979433920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:03,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:37:03,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903737454] [2025-03-04 00:37:03,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:37:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:03,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:37:03,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:03,807 INFO L87 Difference]: Start difference. First operand 289 states and 472 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:37:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:04,630 INFO L93 Difference]: Finished difference Result 1560 states and 2555 transitions. [2025-03-04 00:37:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:37:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 442 [2025-03-04 00:37:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:04,643 INFO L225 Difference]: With dead ends: 1560 [2025-03-04 00:37:04,645 INFO L226 Difference]: Without dead ends: 1274 [2025-03-04 00:37:04,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:04,646 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 1650 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:04,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 3245 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:37:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-03-04 00:37:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1018. [2025-03-04 00:37:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 757 states have (on average 1.5257595772787318) internal successors, (1155), 757 states have internal predecessors, (1155), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:37:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1667 transitions. [2025-03-04 00:37:04,758 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1667 transitions. Word has length 442 [2025-03-04 00:37:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1667 transitions. [2025-03-04 00:37:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:37:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1667 transitions. [2025-03-04 00:37:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-04 00:37:04,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:04,767 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:04,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:37:04,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:04,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1931683236, now seen corresponding path program 1 times [2025-03-04 00:37:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324286588] [2025-03-04 00:37:04,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:04,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-04 00:37:04,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-04 00:37:04,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:04,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324286588] [2025-03-04 00:37:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324286588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:05,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:05,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012912054] [2025-03-04 00:37:05,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:05,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:05,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:05,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:05,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:05,471 INFO L87 Difference]: Start difference. First operand 1018 states and 1667 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:05,850 INFO L93 Difference]: Finished difference Result 2182 states and 3579 transitions. [2025-03-04 00:37:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:05,851 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 443 [2025-03-04 00:37:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:05,861 INFO L225 Difference]: With dead ends: 2182 [2025-03-04 00:37:05,861 INFO L226 Difference]: Without dead ends: 1298 [2025-03-04 00:37:05,864 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-04 00:37:05,864 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 395 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:05,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1323 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-04 00:37:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1018. [2025-03-04 00:37:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 757 states have (on average 1.52443857331572) internal successors, (1154), 757 states have internal predecessors, (1154), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:37:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1666 transitions. [2025-03-04 00:37:05,960 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1666 transitions. Word has length 443 [2025-03-04 00:37:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:05,961 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1666 transitions. [2025-03-04 00:37:05,961 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1666 transitions. [2025-03-04 00:37:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-04 00:37:05,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:05,969 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:37:05,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash 625519090, now seen corresponding path program 1 times [2025-03-04 00:37:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074784266] [2025-03-04 00:37:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:06,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-04 00:37:06,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-04 00:37:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:06,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074784266] [2025-03-04 00:37:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074784266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687566648] [2025-03-04 00:37:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:06,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:06,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:06,933 INFO L87 Difference]: Start difference. First operand 1018 states and 1666 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:07,295 INFO L93 Difference]: Finished difference Result 2201 states and 3611 transitions. [2025-03-04 00:37:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:07,296 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 443 [2025-03-04 00:37:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:07,303 INFO L225 Difference]: With dead ends: 2201 [2025-03-04 00:37:07,304 INFO L226 Difference]: Without dead ends: 1298 [2025-03-04 00:37:07,307 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-04 00:37:07,309 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 484 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:07,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1329 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-04 00:37:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1250. [2025-03-04 00:37:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 989 states have (on average 1.5611729019211324) internal successors, (1544), 989 states have internal predecessors, (1544), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:37:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2056 transitions. [2025-03-04 00:37:07,401 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2056 transitions. Word has length 443 [2025-03-04 00:37:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 2056 transitions. [2025-03-04 00:37:07,402 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, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2056 transitions. [2025-03-04 00:37:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-04 00:37:07,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:07,408 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:07,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:37:07,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:07,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash -761275136, now seen corresponding path program 1 times [2025-03-04 00:37:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:07,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887416961] [2025-03-04 00:37:07,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:07,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-04 00:37:07,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-04 00:37:07,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:07,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887416961] [2025-03-04 00:37:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887416961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:07,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73741630] [2025-03-04 00:37:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:07,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:07,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:07,893 INFO L87 Difference]: Start difference. First operand 1250 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:08,466 INFO L93 Difference]: Finished difference Result 1955 states and 3205 transitions. [2025-03-04 00:37:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:37:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 444 [2025-03-04 00:37:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:08,476 INFO L225 Difference]: With dead ends: 1955 [2025-03-04 00:37:08,476 INFO L226 Difference]: Without dead ends: 1578 [2025-03-04 00:37:08,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:37:08,478 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 707 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:08,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1920 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:37:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-04 00:37:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1368. [2025-03-04 00:37:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1107 states have (on average 1.5772357723577235) internal successors, (1746), 1107 states have internal predecessors, (1746), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:37:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2258 transitions. [2025-03-04 00:37:08,592 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2258 transitions. Word has length 444 [2025-03-04 00:37:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:08,593 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2258 transitions. [2025-03-04 00:37:08,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2258 transitions. [2025-03-04 00:37:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-04 00:37:08,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:08,601 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:08,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:37:08,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1863178591, now seen corresponding path program 1 times [2025-03-04 00:37:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796897280] [2025-03-04 00:37:08,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:08,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-04 00:37:08,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-04 00:37:08,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:08,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:08,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796897280] [2025-03-04 00:37:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796897280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:08,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:08,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699580393] [2025-03-04 00:37:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:08,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:08,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:08,866 INFO L87 Difference]: Start difference. First operand 1368 states and 2258 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:09,013 INFO L93 Difference]: Finished difference Result 2713 states and 4469 transitions. [2025-03-04 00:37:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:09,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 444 [2025-03-04 00:37:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:09,024 INFO L225 Difference]: With dead ends: 2713 [2025-03-04 00:37:09,025 INFO L226 Difference]: Without dead ends: 2336 [2025-03-04 00:37:09,027 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-04 00:37:09,027 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 322 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:09,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1120 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-04 00:37:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1381. [2025-03-04 00:37:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1120 states have (on average 1.574107142857143) internal successors, (1763), 1120 states have internal predecessors, (1763), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:37:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2275 transitions. [2025-03-04 00:37:09,136 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2275 transitions. Word has length 444 [2025-03-04 00:37:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:09,138 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2275 transitions. [2025-03-04 00:37:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2275 transitions. [2025-03-04 00:37:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-04 00:37:09,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:09,142 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:09,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:37:09,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:09,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1400928299, now seen corresponding path program 1 times [2025-03-04 00:37:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038799782] [2025-03-04 00:37:09,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:09,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-04 00:37:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 00:37:09,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038799782] [2025-03-04 00:37:09,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038799782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:09,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:37:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878143291] [2025-03-04 00:37:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:09,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:37:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:09,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:37:09,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:09,663 INFO L87 Difference]: Start difference. First operand 1381 states and 2275 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:10,408 INFO L93 Difference]: Finished difference Result 4949 states and 8144 transitions. [2025-03-04 00:37:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:37:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 445 [2025-03-04 00:37:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:10,427 INFO L225 Difference]: With dead ends: 4949 [2025-03-04 00:37:10,427 INFO L226 Difference]: Without dead ends: 3738 [2025-03-04 00:37:10,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:10,433 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1206 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:10,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 2187 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:37:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2025-03-04 00:37:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 2860. [2025-03-04 00:37:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2565 states have (on average 1.6292397660818714) internal successors, (4179), 2568 states have internal predecessors, (4179), 286 states have call successors, (286), 8 states have call predecessors, (286), 8 states have return successors, (286), 283 states have call predecessors, (286), 286 states have call successors, (286) [2025-03-04 00:37:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4751 transitions. [2025-03-04 00:37:10,567 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4751 transitions. Word has length 445 [2025-03-04 00:37:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:10,567 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4751 transitions. [2025-03-04 00:37:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4751 transitions. [2025-03-04 00:37:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-04 00:37:10,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:10,573 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:10,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:37:10,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1647241386, now seen corresponding path program 1 times [2025-03-04 00:37:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462579112] [2025-03-04 00:37:10,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-04 00:37:10,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 00:37:10,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:10,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462579112] [2025-03-04 00:37:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462579112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:10,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127813847] [2025-03-04 00:37:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:10,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:10,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:10,886 INFO L87 Difference]: Start difference. First operand 2860 states and 4751 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:11,678 INFO L93 Difference]: Finished difference Result 6100 states and 10094 transitions. [2025-03-04 00:37:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 445 [2025-03-04 00:37:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:11,697 INFO L225 Difference]: With dead ends: 6100 [2025-03-04 00:37:11,698 INFO L226 Difference]: Without dead ends: 4150 [2025-03-04 00:37:11,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:11,703 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 634 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:11,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 2042 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:37:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2025-03-04 00:37:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 3881. [2025-03-04 00:37:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 3434 states have (on average 1.613861386138614) internal successors, (5542), 3439 states have internal predecessors, (5542), 434 states have call successors, (434), 12 states have call predecessors, (434), 12 states have return successors, (434), 429 states have call predecessors, (434), 434 states have call successors, (434) [2025-03-04 00:37:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 6410 transitions. [2025-03-04 00:37:11,937 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 6410 transitions. Word has length 445 [2025-03-04 00:37:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 3881 states and 6410 transitions. [2025-03-04 00:37:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 6410 transitions. [2025-03-04 00:37:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-04 00:37:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:11,946 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:11,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:37:11,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash -813335208, now seen corresponding path program 1 times [2025-03-04 00:37:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70932156] [2025-03-04 00:37:11,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:11,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 00:37:12,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 00:37:12,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:12,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:12,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70932156] [2025-03-04 00:37:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70932156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:12,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213013337] [2025-03-04 00:37:12,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:12,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:12,548 INFO L87 Difference]: Start difference. First operand 3881 states and 6410 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:12,817 INFO L93 Difference]: Finished difference Result 10689 states and 17644 transitions. [2025-03-04 00:37:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 446 [2025-03-04 00:37:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:12,851 INFO L225 Difference]: With dead ends: 10689 [2025-03-04 00:37:12,851 INFO L226 Difference]: Without dead ends: 7449 [2025-03-04 00:37:12,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:12,861 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 315 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:12,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1987 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2025-03-04 00:37:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7434. [2025-03-04 00:37:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7434 states, 6607 states have (on average 1.6123808082336915) internal successors, (10653), 6617 states have internal predecessors, (10653), 804 states have call successors, (804), 22 states have call predecessors, (804), 22 states have return successors, (804), 794 states have call predecessors, (804), 804 states have call successors, (804) [2025-03-04 00:37:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 12261 transitions. [2025-03-04 00:37:13,187 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 12261 transitions. Word has length 446 [2025-03-04 00:37:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 7434 states and 12261 transitions. [2025-03-04 00:37:13,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 12261 transitions. [2025-03-04 00:37:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-04 00:37:13,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:13,197 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:13,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:13,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:13,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -875067539, now seen corresponding path program 1 times [2025-03-04 00:37:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812539522] [2025-03-04 00:37:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-04 00:37:13,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-04 00:37:13,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:13,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:13,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812539522] [2025-03-04 00:37:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812539522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74735665] [2025-03-04 00:37:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:13,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:13,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:13,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:13,795 INFO L87 Difference]: Start difference. First operand 7434 states and 12261 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:14,358 INFO L93 Difference]: Finished difference Result 27945 states and 46111 transitions. [2025-03-04 00:37:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 447 [2025-03-04 00:37:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:14,416 INFO L225 Difference]: With dead ends: 27945 [2025-03-04 00:37:14,416 INFO L226 Difference]: Without dead ends: 20696 [2025-03-04 00:37:14,438 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-04 00:37:14,439 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1024 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:14,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1408 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20696 states. [2025-03-04 00:37:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20696 to 14515. [2025-03-04 00:37:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14515 states, 12928 states have (on average 1.6033415841584158) internal successors, (20728), 12948 states have internal predecessors, (20728), 1544 states have call successors, (1544), 42 states have call predecessors, (1544), 42 states have return successors, (1544), 1524 states have call predecessors, (1544), 1544 states have call successors, (1544) [2025-03-04 00:37:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14515 states to 14515 states and 23816 transitions. [2025-03-04 00:37:15,265 INFO L78 Accepts]: Start accepts. Automaton has 14515 states and 23816 transitions. Word has length 447 [2025-03-04 00:37:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:15,266 INFO L471 AbstractCegarLoop]: Abstraction has 14515 states and 23816 transitions. [2025-03-04 00:37:15,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14515 states and 23816 transitions. [2025-03-04 00:37:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-04 00:37:15,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:15,274 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:37:15,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1083765842, now seen corresponding path program 1 times [2025-03-04 00:37:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309085666] [2025-03-04 00:37:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-04 00:37:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-04 00:37:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:37:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309085666] [2025-03-04 00:37:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309085666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:15,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652040714] [2025-03-04 00:37:15,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:15,962 INFO L87 Difference]: Start difference. First operand 14515 states and 23816 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:16,433 INFO L93 Difference]: Finished difference Result 39759 states and 65151 transitions. [2025-03-04 00:37:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:16,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 447 [2025-03-04 00:37:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:16,509 INFO L225 Difference]: With dead ends: 39759 [2025-03-04 00:37:16,509 INFO L226 Difference]: Without dead ends: 25921 [2025-03-04 00:37:16,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 00:37:16,544 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 258 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:16,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1282 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25921 states. [2025-03-04 00:37:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25921 to 25899. [2025-03-04 00:37:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25899 states, 23771 states have (on average 1.6083042362542594) internal successors, (38231), 23831 states have internal predecessors, (38231), 2044 states have call successors, (2044), 83 states have call predecessors, (2044), 83 states have return successors, (2044), 1984 states have call predecessors, (2044), 2044 states have call successors, (2044) [2025-03-04 00:37:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25899 states to 25899 states and 42319 transitions. [2025-03-04 00:37:17,314 INFO L78 Accepts]: Start accepts. Automaton has 25899 states and 42319 transitions. Word has length 447 [2025-03-04 00:37:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:17,315 INFO L471 AbstractCegarLoop]: Abstraction has 25899 states and 42319 transitions. [2025-03-04 00:37:17,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25899 states and 42319 transitions. [2025-03-04 00:37:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-04 00:37:17,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:17,328 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:37:17,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1908528287, now seen corresponding path program 1 times [2025-03-04 00:37:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207815969] [2025-03-04 00:37:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:17,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-04 00:37:18,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-04 00:37:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:18,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207815969] [2025-03-04 00:37:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207815969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:18,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631141002] [2025-03-04 00:37:18,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:18,519 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-04 00:37:18,520 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-04 00:37:18,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-04 00:37:18,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-04 00:37:18,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:18,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:37:18,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 1682 proven. 351 refuted. 0 times theorem prover too weak. 6031 trivial. 0 not checked. [2025-03-04 00:37:20,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 21 proven. 354 refuted. 0 times theorem prover too weak. 7689 trivial. 0 not checked. [2025-03-04 00:37:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631141002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:20,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 18 [2025-03-04 00:37:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298389215] [2025-03-04 00:37:20,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:20,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:37:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:20,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:37:20,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:37:20,823 INFO L87 Difference]: Start difference. First operand 25899 states and 42319 transitions. Second operand has 18 states, 18 states have (on average 13.0) internal successors, (234), 18 states have internal predecessors, (234), 5 states have call successors, (190), 3 states have call predecessors, (190), 7 states have return successors, (191), 4 states have call predecessors, (191), 5 states have call successors, (191) [2025-03-04 00:37:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:23,197 INFO L93 Difference]: Finished difference Result 81593 states and 134668 transitions. [2025-03-04 00:37:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:37:23,198 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.0) internal successors, (234), 18 states have internal predecessors, (234), 5 states have call successors, (190), 3 states have call predecessors, (190), 7 states have return successors, (191), 4 states have call predecessors, (191), 5 states have call successors, (191) Word has length 448 [2025-03-04 00:37:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:23,417 INFO L225 Difference]: With dead ends: 81593 [2025-03-04 00:37:23,418 INFO L226 Difference]: Without dead ends: 55832 [2025-03-04 00:37:23,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 886 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:37:23,455 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 3052 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:23,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 3165 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:37:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55832 states. [2025-03-04 00:37:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55832 to 31531. [2025-03-04 00:37:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31531 states, 29241 states have (on average 1.5856160870011287) internal successors, (46365), 29301 states have internal predecessors, (46365), 2044 states have call successors, (2044), 245 states have call predecessors, (2044), 245 states have return successors, (2044), 1984 states have call predecessors, (2044), 2044 states have call successors, (2044) [2025-03-04 00:37:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31531 states to 31531 states and 50453 transitions. [2025-03-04 00:37:24,719 INFO L78 Accepts]: Start accepts. Automaton has 31531 states and 50453 transitions. Word has length 448 [2025-03-04 00:37:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:24,720 INFO L471 AbstractCegarLoop]: Abstraction has 31531 states and 50453 transitions. [2025-03-04 00:37:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.0) internal successors, (234), 18 states have internal predecessors, (234), 5 states have call successors, (190), 3 states have call predecessors, (190), 7 states have return successors, (191), 4 states have call predecessors, (191), 5 states have call successors, (191) [2025-03-04 00:37:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31531 states and 50453 transitions. [2025-03-04 00:37:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-04 00:37:24,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:24,736 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:24,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:37:24,936 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,SelfDestructingSolverStorable11 [2025-03-04 00:37:24,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:24,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash 908522014, now seen corresponding path program 1 times [2025-03-04 00:37:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733886990] [2025-03-04 00:37:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:25,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-04 00:37:25,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-04 00:37:25,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:25,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 27 proven. 162 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733886990] [2025-03-04 00:37:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733886990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156011898] [2025-03-04 00:37:28,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:28,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:28,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:28,332 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:28,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:37:28,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-04 00:37:28,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-04 00:37:28,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:28,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:28,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:28,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 3789 proven. 120 refuted. 0 times theorem prover too weak. 4155 trivial. 0 not checked. [2025-03-04 00:37:29,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 69 proven. 120 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156011898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:29,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 21 [2025-03-04 00:37:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660838454] [2025-03-04 00:37:29,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:29,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:37:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:29,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:37:29,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:37:29,412 INFO L87 Difference]: Start difference. First operand 31531 states and 50453 transitions. Second operand has 21 states, 21 states have (on average 14.761904761904763) internal successors, (310), 21 states have internal predecessors, (310), 7 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (169), 6 states have call predecessors, (169), 7 states have call successors, (169) [2025-03-04 00:37:33,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:37:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:35,811 INFO L93 Difference]: Finished difference Result 75049 states and 119432 transitions. [2025-03-04 00:37:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:37:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 14.761904761904763) internal successors, (310), 21 states have internal predecessors, (310), 7 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (169), 6 states have call predecessors, (169), 7 states have call successors, (169) Word has length 448 [2025-03-04 00:37:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:35,917 INFO L225 Difference]: With dead ends: 75049 [2025-03-04 00:37:35,917 INFO L226 Difference]: Without dead ends: 44359 [2025-03-04 00:37:35,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 946 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=600, Invalid=2052, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 00:37:35,968 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 6910 mSDsluCounter, 3935 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6933 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:35,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6933 Valid, 4429 Invalid, 4039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 00:37:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44359 states. [2025-03-04 00:37:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44359 to 32290. [2025-03-04 00:37:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32290 states, 29978 states have (on average 1.5745880312228968) internal successors, (47203), 30038 states have internal predecessors, (47203), 2044 states have call successors, (2044), 267 states have call predecessors, (2044), 267 states have return successors, (2044), 1984 states have call predecessors, (2044), 2044 states have call successors, (2044) [2025-03-04 00:37:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32290 states to 32290 states and 51291 transitions. [2025-03-04 00:37:37,018 INFO L78 Accepts]: Start accepts. Automaton has 32290 states and 51291 transitions. Word has length 448 [2025-03-04 00:37:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:37,019 INFO L471 AbstractCegarLoop]: Abstraction has 32290 states and 51291 transitions. [2025-03-04 00:37:37,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.761904761904763) internal successors, (310), 21 states have internal predecessors, (310), 7 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (169), 6 states have call predecessors, (169), 7 states have call successors, (169) [2025-03-04 00:37:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32290 states and 51291 transitions. [2025-03-04 00:37:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-04 00:37:37,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:37,035 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:37,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:37,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:37,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -887915575, now seen corresponding path program 1 times [2025-03-04 00:37:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095024710] [2025-03-04 00:37:37,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:37,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:37,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:37,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 27 proven. 162 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095024710] [2025-03-04 00:37:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095024710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123494564] [2025-03-04 00:37:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:39,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:39,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:39,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:39,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:37:39,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:39,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:39,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:39,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:37:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123494564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:39,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:37:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 13 [2025-03-04 00:37:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292903511] [2025-03-04 00:37:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:39,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:39,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:39,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:39,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:37:39,420 INFO L87 Difference]: Start difference. First operand 32290 states and 51291 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:40,366 INFO L93 Difference]: Finished difference Result 64346 states and 102075 transitions. [2025-03-04 00:37:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:37:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 1 states have call successors, (64) Word has length 449 [2025-03-04 00:37:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:40,454 INFO L225 Difference]: With dead ends: 64346 [2025-03-04 00:37:40,455 INFO L226 Difference]: Without dead ends: 32500 [2025-03-04 00:37:40,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 450 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:37:40,503 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 351 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:40,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 969 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32500 states. [2025-03-04 00:37:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32500 to 32374. [2025-03-04 00:37:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32374 states, 30041 states have (on average 1.5612662694317765) internal successors, (46902), 30101 states have internal predecessors, (46902), 2044 states have call successors, (2044), 288 states have call predecessors, (2044), 288 states have return successors, (2044), 1984 states have call predecessors, (2044), 2044 states have call successors, (2044) [2025-03-04 00:37:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32374 states to 32374 states and 50990 transitions. [2025-03-04 00:37:41,646 INFO L78 Accepts]: Start accepts. Automaton has 32374 states and 50990 transitions. Word has length 449 [2025-03-04 00:37:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 32374 states and 50990 transitions. [2025-03-04 00:37:41,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (64), 1 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:37:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 32374 states and 50990 transitions. [2025-03-04 00:37:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-04 00:37:41,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:41,660 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:41,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:41,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:41,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1496769991, now seen corresponding path program 1 times [2025-03-04 00:37:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258398612] [2025-03-04 00:37:41,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:42,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:42,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:42,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 27 proven. 162 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:44,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258398612] [2025-03-04 00:37:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258398612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944032026] [2025-03-04 00:37:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:44,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:44,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:37:44,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:44,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:44,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:44,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:44,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4093 proven. 96 refuted. 0 times theorem prover too weak. 3875 trivial. 0 not checked. [2025-03-04 00:37:44,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 93 proven. 96 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944032026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:44,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 18 [2025-03-04 00:37:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870080988] [2025-03-04 00:37:44,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:37:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:44,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:37:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:37:44,953 INFO L87 Difference]: Start difference. First operand 32374 states and 50990 transitions. Second operand has 18 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 7 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 6 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-04 00:37:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:48,361 INFO L93 Difference]: Finished difference Result 67067 states and 105200 transitions. [2025-03-04 00:37:48,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 00:37:48,362 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 7 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 6 states have call predecessors, (161), 7 states have call successors, (161) Word has length 449 [2025-03-04 00:37:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:48,450 INFO L225 Difference]: With dead ends: 67067 [2025-03-04 00:37:48,450 INFO L226 Difference]: Without dead ends: 38697 [2025-03-04 00:37:48,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 898 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:37:48,499 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 4056 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:48,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4087 Valid, 3337 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 00:37:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38697 states. [2025-03-04 00:37:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38697 to 36455. [2025-03-04 00:37:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36455 states, 34101 states have (on average 1.5579601771209055) internal successors, (53128), 34161 states have internal predecessors, (53128), 2044 states have call successors, (2044), 309 states have call predecessors, (2044), 309 states have return successors, (2044), 1984 states have call predecessors, (2044), 2044 states have call successors, (2044) [2025-03-04 00:37:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36455 states to 36455 states and 57216 transitions. [2025-03-04 00:37:49,475 INFO L78 Accepts]: Start accepts. Automaton has 36455 states and 57216 transitions. Word has length 449 [2025-03-04 00:37:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:49,476 INFO L471 AbstractCegarLoop]: Abstraction has 36455 states and 57216 transitions. [2025-03-04 00:37:49,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 7 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 6 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-04 00:37:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36455 states and 57216 transitions. [2025-03-04 00:37:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-04 00:37:49,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:49,495 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:49,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:37:49,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:37:49,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 182250728, now seen corresponding path program 1 times [2025-03-04 00:37:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100900773] [2025-03-04 00:37:49,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:49,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:50,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:50,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:50,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 42 proven. 147 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:37:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100900773] [2025-03-04 00:37:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100900773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212358889] [2025-03-04 00:37:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:51,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:51,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:37:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-04 00:37:51,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-04 00:37:51,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:51,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:37:51,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4037 proven. 462 refuted. 0 times theorem prover too weak. 3565 trivial. 0 not checked. [2025-03-04 00:37:53,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 87 proven. 471 refuted. 0 times theorem prover too weak. 7506 trivial. 0 not checked. [2025-03-04 00:37:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212358889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:54,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 29 [2025-03-04 00:37:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512485347] [2025-03-04 00:37:54,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:54,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 00:37:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:54,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 00:37:54,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:37:54,212 INFO L87 Difference]: Start difference. First operand 36455 states and 57216 transitions. Second operand has 29 states, 29 states have (on average 12.448275862068966) internal successors, (361), 29 states have internal predecessors, (361), 8 states have call successors, (190), 4 states have call predecessors, (190), 10 states have return successors, (192), 8 states have call predecessors, (192), 8 states have call successors, (192)