./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.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_amount250_file-3.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 c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:09:59,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:09:59,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:09:59,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:09:59,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:09:59,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:09:59,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:09:59,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:09:59,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:09:59,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:09:59,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:09:59,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:09:59,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:09:59,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:09:59,750 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:09:59,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:09:59,751 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:09:59,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:09:59,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:09:59,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:09:59,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:09:59,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:09:59,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:59,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:09:59,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:09:59,753 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 -> c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 [2025-03-04 00:09:59,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:09:59,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:09:59,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:09:59,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:09:59,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:09:59,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-03-04 00:10:01,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc5014f8/5014d95b8d2b458d8c29cd4fd26bf3f8/FLAG7dfb03600 [2025-03-04 00:10:01,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:01,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-03-04 00:10:01,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc5014f8/5014d95b8d2b458d8c29cd4fd26bf3f8/FLAG7dfb03600 [2025-03-04 00:10:01,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adc5014f8/5014d95b8d2b458d8c29cd4fd26bf3f8 [2025-03-04 00:10:01,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:01,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:01,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:01,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:01,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:01,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:01" (1/1) ... [2025-03-04 00:10:01,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:01, skipping insertion in model container [2025-03-04 00:10:01,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:01" (1/1) ... [2025-03-04 00:10:01,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:02,030 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_amount250_file-3.i[915,928] [2025-03-04 00:10:02,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:02,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:02,204 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_amount250_file-3.i[915,928] [2025-03-04 00:10:02,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:02,278 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:02,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02 WrapperNode [2025-03-04 00:10:02,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:02,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:02,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:02,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:02,286 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:10:02" (1/1) ... [2025-03-04 00:10:02,299 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:10:02" (1/1) ... [2025-03-04 00:10:02,342 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-03-04 00:10:02,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:02,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:02,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:02,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:02,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,399 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:10:02,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:02,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:02,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:02,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:02,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (1/1) ... [2025-03-04 00:10:02,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:02,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:02,472 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:10:02,477 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:10:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:02,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:02,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:02,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:02,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:03,485 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1;havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~bitwise50#1;havoc property_#t~short51#1; [2025-03-04 00:10:03,568 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:03,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:03,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:03,601 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:10:03,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:03 BoogieIcfgContainer [2025-03-04 00:10:03,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:03,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:03,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:03,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:03,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:01" (1/3) ... [2025-03-04 00:10:03,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784a9168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:03, skipping insertion in model container [2025-03-04 00:10:03,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:02" (2/3) ... [2025-03-04 00:10:03,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784a9168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:03, skipping insertion in model container [2025-03-04 00:10:03,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:03" (3/3) ... [2025-03-04 00:10:03,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-3.i [2025-03-04 00:10:03,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:03,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-3.i that has 2 procedures, 208 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:03,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:03,711 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;@5aa757c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:03,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:10:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:03,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:03,728 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:03,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:03,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1116557967, now seen corresponding path program 1 times [2025-03-04 00:10:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086007794] [2025-03-04 00:10:03,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:03,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-04 00:10:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086007794] [2025-03-04 00:10:04,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086007794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:04,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546454624] [2025-03-04 00:10:04,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:04,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:04,299 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:10:04,301 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:10:04,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:04,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:04,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:04,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:04,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:04,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-04 00:10:04,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546454624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:04,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080870517] [2025-03-04 00:10:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:04,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:04,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:04,635 INFO L87 Difference]: Start difference. First operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:10:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:04,689 INFO L93 Difference]: Finished difference Result 410 states and 719 transitions. [2025-03-04 00:10:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 372 [2025-03-04 00:10:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:04,698 INFO L225 Difference]: With dead ends: 410 [2025-03-04 00:10:04,699 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 00:10:04,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 373 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:10:04,705 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:04,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 00:10:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 00:10:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:10:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2025-03-04 00:10:04,751 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 372 [2025-03-04 00:10:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:04,751 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2025-03-04 00:10:04,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:10:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2025-03-04 00:10:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:04,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:04,758 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:04,959 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:10:04,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:04,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1267601709, now seen corresponding path program 1 times [2025-03-04 00:10:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220009610] [2025-03-04 00:10:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:04,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:05,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:05,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:05,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220009610] [2025-03-04 00:10:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220009610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729766566] [2025-03-04 00:10:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:05,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:05,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:05,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:05,642 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:05,965 INFO L93 Difference]: Finished difference Result 594 states and 946 transitions. [2025-03-04 00:10:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:10:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-03-04 00:10:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:05,973 INFO L225 Difference]: With dead ends: 594 [2025-03-04 00:10:05,973 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 00:10:05,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:05,975 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 387 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:05,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1231 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 00:10:06,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 386. [2025-03-04 00:10:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 310 states have (on average 1.5225806451612902) internal successors, (472), 312 states have internal predecessors, (472), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-04 00:10:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 616 transitions. [2025-03-04 00:10:06,022 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 616 transitions. Word has length 372 [2025-03-04 00:10:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:06,023 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 616 transitions. [2025-03-04 00:10:06,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 616 transitions. [2025-03-04 00:10:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:06,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:06,030 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:06,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -604843378, now seen corresponding path program 1 times [2025-03-04 00:10:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279711177] [2025-03-04 00:10:06,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:06,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:06,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:06,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:07,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279711177] [2025-03-04 00:10:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279711177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:07,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658857763] [2025-03-04 00:10:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:07,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:07,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:07,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:07,278 INFO L87 Difference]: Start difference. First operand 386 states and 616 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:07,774 INFO L93 Difference]: Finished difference Result 1416 states and 2256 transitions. [2025-03-04 00:10:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:10:07,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-03-04 00:10:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:07,783 INFO L225 Difference]: With dead ends: 1416 [2025-03-04 00:10:07,783 INFO L226 Difference]: Without dead ends: 1033 [2025-03-04 00:10:07,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:07,788 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 409 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:07,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1342 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:10:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-03-04 00:10:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 827. [2025-03-04 00:10:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 708 states have (on average 1.5508474576271187) internal successors, (1098), 713 states have internal predecessors, (1098), 112 states have call successors, (112), 6 states have call predecessors, (112), 6 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:10:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1322 transitions. [2025-03-04 00:10:07,875 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1322 transitions. Word has length 372 [2025-03-04 00:10:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:07,876 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1322 transitions. [2025-03-04 00:10:07,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1322 transitions. [2025-03-04 00:10:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:07,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:07,884 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:07,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:07,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -845383507, now seen corresponding path program 1 times [2025-03-04 00:10:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164018238] [2025-03-04 00:10:07,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:07,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:08,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:08,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:08,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164018238] [2025-03-04 00:10:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164018238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:10:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227201280] [2025-03-04 00:10:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:08,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:10:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:08,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:10:08,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:10:08,637 INFO L87 Difference]: Start difference. First operand 827 states and 1322 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:09,962 INFO L93 Difference]: Finished difference Result 2487 states and 3936 transitions. [2025-03-04 00:10:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:10:09,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 372 [2025-03-04 00:10:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:09,972 INFO L225 Difference]: With dead ends: 2487 [2025-03-04 00:10:09,973 INFO L226 Difference]: Without dead ends: 1663 [2025-03-04 00:10:09,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:10:09,976 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1571 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:09,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1513 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:10:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-04 00:10:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1457. [2025-03-04 00:10:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1302 states have (on average 1.5614439324116745) internal successors, (2033), 1312 states have internal predecessors, (2033), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:10:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2303 transitions. [2025-03-04 00:10:10,098 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2303 transitions. Word has length 372 [2025-03-04 00:10:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:10,100 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 2303 transitions. [2025-03-04 00:10:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2303 transitions. [2025-03-04 00:10:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:10,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:10,112 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:10,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:10:10,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1675163732, now seen corresponding path program 1 times [2025-03-04 00:10:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491953268] [2025-03-04 00:10:10,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:10,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:10,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:10,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:10,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:10,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491953268] [2025-03-04 00:10:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491953268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:10:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665216553] [2025-03-04 00:10:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:10:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:10,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:10:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:10,563 INFO L87 Difference]: Start difference. First operand 1457 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:11,298 INFO L93 Difference]: Finished difference Result 6750 states and 10499 transitions. [2025-03-04 00:10:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:10:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-03-04 00:10:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:11,332 INFO L225 Difference]: With dead ends: 6750 [2025-03-04 00:10:11,333 INFO L226 Difference]: Without dead ends: 5296 [2025-03-04 00:10:11,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:11,342 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 840 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:11,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1902 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:10:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2025-03-04 00:10:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 1841. [2025-03-04 00:10:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1686 states have (on average 1.5842230130486359) internal successors, (2671), 1696 states have internal predecessors, (2671), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:10:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2941 transitions. [2025-03-04 00:10:11,499 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2941 transitions. Word has length 372 [2025-03-04 00:10:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:11,500 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2941 transitions. [2025-03-04 00:10:11,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2941 transitions. [2025-03-04 00:10:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-04 00:10:11,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:11,509 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:10:11,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -430399251, now seen corresponding path program 1 times [2025-03-04 00:10:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887680686] [2025-03-04 00:10:11,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:11,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-04 00:10:11,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-04 00:10:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887680686] [2025-03-04 00:10:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887680686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527853547] [2025-03-04 00:10:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:12,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:12,163 INFO L87 Difference]: Start difference. First operand 1841 states and 2941 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:12,601 INFO L93 Difference]: Finished difference Result 4203 states and 6673 transitions. [2025-03-04 00:10:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:10:12,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-03-04 00:10:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:12,611 INFO L225 Difference]: With dead ends: 4203 [2025-03-04 00:10:12,611 INFO L226 Difference]: Without dead ends: 2365 [2025-03-04 00:10:12,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:12,615 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 555 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:12,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1374 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-03-04 00:10:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1851. [2025-03-04 00:10:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1691 states have (on average 1.582495564754583) internal successors, (2676), 1701 states have internal predecessors, (2676), 139 states have call successors, (139), 20 states have call predecessors, (139), 20 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-04 00:10:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2954 transitions. [2025-03-04 00:10:12,697 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2954 transitions. Word has length 372 [2025-03-04 00:10:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 2954 transitions. [2025-03-04 00:10:12,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2954 transitions. [2025-03-04 00:10:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 00:10:12,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:12,705 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:10:12,706 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1052793764, now seen corresponding path program 1 times [2025-03-04 00:10:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532594209] [2025-03-04 00:10:12,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-04 00:10:12,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 00:10:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:12,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532594209] [2025-03-04 00:10:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532594209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:13,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:13,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:10:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056489803] [2025-03-04 00:10:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:13,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:10:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:13,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:10:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:10:13,220 INFO L87 Difference]: Start difference. First operand 1851 states and 2954 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:10:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:14,586 INFO L93 Difference]: Finished difference Result 5128 states and 8154 transitions. [2025-03-04 00:10:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:10:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 373 [2025-03-04 00:10:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:14,602 INFO L225 Difference]: With dead ends: 5128 [2025-03-04 00:10:14,603 INFO L226 Difference]: Without dead ends: 3280 [2025-03-04 00:10:14,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:10:14,607 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1705 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:14,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1566 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:10:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2025-03-04 00:10:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 1897. [2025-03-04 00:10:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1737 states have (on average 1.583189407023604) internal successors, (2750), 1747 states have internal predecessors, (2750), 139 states have call successors, (139), 20 states have call predecessors, (139), 20 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-04 00:10:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3028 transitions. [2025-03-04 00:10:14,708 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3028 transitions. Word has length 373 [2025-03-04 00:10:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:14,709 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 3028 transitions. [2025-03-04 00:10:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-04 00:10:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3028 transitions. [2025-03-04 00:10:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 00:10:14,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:14,717 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:10:14,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:14,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1041477637, now seen corresponding path program 1 times [2025-03-04 00:10:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50788184] [2025-03-04 00:10:14,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:14,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-04 00:10:14,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 00:10:14,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:14,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50788184] [2025-03-04 00:10:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50788184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776827592] [2025-03-04 00:10:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:15,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:15,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:15,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:15,443 INFO L87 Difference]: Start difference. First operand 1897 states and 3028 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:15,748 INFO L93 Difference]: Finished difference Result 5203 states and 8292 transitions. [2025-03-04 00:10:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 373 [2025-03-04 00:10:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:15,764 INFO L225 Difference]: With dead ends: 5203 [2025-03-04 00:10:15,764 INFO L226 Difference]: Without dead ends: 3309 [2025-03-04 00:10:15,770 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:10:15,770 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 205 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:15,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 838 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-03-04 00:10:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3305. [2025-03-04 00:10:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3045 states have (on average 1.5779967159277504) internal successors, (4805), 3065 states have internal predecessors, (4805), 223 states have call successors, (223), 36 states have call predecessors, (223), 36 states have return successors, (223), 203 states have call predecessors, (223), 223 states have call successors, (223) [2025-03-04 00:10:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 5251 transitions. [2025-03-04 00:10:15,926 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 5251 transitions. Word has length 373 [2025-03-04 00:10:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:15,927 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 5251 transitions. [2025-03-04 00:10:15,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 5251 transitions. [2025-03-04 00:10:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-04 00:10:15,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:15,937 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:10:15,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1830390566, now seen corresponding path program 1 times [2025-03-04 00:10:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747863700] [2025-03-04 00:10:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 00:10:16,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 00:10:16,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:16,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 93 proven. 231 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-03-04 00:10:16,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:16,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747863700] [2025-03-04 00:10:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747863700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47287039] [2025-03-04 00:10:16,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:16,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:16,630 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:10:16,634 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:10:16,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 00:10:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 00:10:16,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:16,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:10:16,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3102 proven. 105 refuted. 0 times theorem prover too weak. 2953 trivial. 0 not checked. [2025-03-04 00:10:18,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47287039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:18,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-03-04 00:10:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086725139] [2025-03-04 00:10:18,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:18,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:10:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:18,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:10:18,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:18,879 INFO L87 Difference]: Start difference. First operand 3305 states and 5251 transitions. Second operand has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) [2025-03-04 00:10:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:20,460 INFO L93 Difference]: Finished difference Result 7900 states and 12478 transitions. [2025-03-04 00:10:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:10:20,461 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) Word has length 374 [2025-03-04 00:10:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:20,484 INFO L225 Difference]: With dead ends: 7900 [2025-03-04 00:10:20,485 INFO L226 Difference]: Without dead ends: 4598 [2025-03-04 00:10:20,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:10:20,498 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1594 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:20,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1035 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:10:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2025-03-04 00:10:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4010. [2025-03-04 00:10:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 3744 states have (on average 1.5809294871794872) internal successors, (5919), 3764 states have internal predecessors, (5919), 223 states have call successors, (223), 42 states have call predecessors, (223), 42 states have return successors, (223), 203 states have call predecessors, (223), 223 states have call successors, (223) [2025-03-04 00:10:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6365 transitions. [2025-03-04 00:10:20,713 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6365 transitions. Word has length 374 [2025-03-04 00:10:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:20,714 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6365 transitions. [2025-03-04 00:10:20,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) [2025-03-04 00:10:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6365 transitions. [2025-03-04 00:10:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:10:20,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:20,724 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,738 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:10:20,924 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,SelfDestructingSolverStorable8 [2025-03-04 00:10:20,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1729294844, now seen corresponding path program 1 times [2025-03-04 00:10:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580474654] [2025-03-04 00:10:20,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:20,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:21,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:21,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:21,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580474654] [2025-03-04 00:10:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580474654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709323167] [2025-03-04 00:10:21,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:21,352 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:10:21,354 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:10:21,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:21,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:21,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:21,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:21,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:10:21,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1729 proven. 138 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2025-03-04 00:10:21,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709323167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:22,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 00:10:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522742590] [2025-03-04 00:10:22,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:22,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:10:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:22,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:10:22,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:10:22,059 INFO L87 Difference]: Start difference. First operand 4010 states and 6365 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-03-04 00:10:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:22,776 INFO L93 Difference]: Finished difference Result 7521 states and 11835 transitions. [2025-03-04 00:10:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:10:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 375 [2025-03-04 00:10:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:22,795 INFO L225 Difference]: With dead ends: 7521 [2025-03-04 00:10:22,795 INFO L226 Difference]: Without dead ends: 3514 [2025-03-04 00:10:22,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:10:22,802 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 734 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:22,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1478 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:10:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2025-03-04 00:10:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 2606. [2025-03-04 00:10:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2385 states have (on average 1.5538784067085953) internal successors, (3706), 2397 states have internal predecessors, (3706), 179 states have call successors, (179), 41 states have call predecessors, (179), 41 states have return successors, (179), 167 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-04 00:10:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 4064 transitions. [2025-03-04 00:10:22,911 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 4064 transitions. Word has length 375 [2025-03-04 00:10:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:22,912 INFO L471 AbstractCegarLoop]: Abstraction has 2606 states and 4064 transitions. [2025-03-04 00:10:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-03-04 00:10:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 4064 transitions. [2025-03-04 00:10:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:10:22,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:22,917 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,926 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:10:23,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:23,119 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -271157570, now seen corresponding path program 1 times [2025-03-04 00:10:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109974748] [2025-03-04 00:10:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:23,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:23,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:23,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109974748] [2025-03-04 00:10:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109974748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634668349] [2025-03-04 00:10:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:23,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:23,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:23,844 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:10:23,846 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:10:23,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:24,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:24,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:24,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:24,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:10:24,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4131 proven. 288 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-03-04 00:10:25,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634668349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:26,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 11] total 25 [2025-03-04 00:10:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479146960] [2025-03-04 00:10:26,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:26,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 00:10:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:26,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 00:10:26,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:10:26,501 INFO L87 Difference]: Start difference. First operand 2606 states and 4064 transitions. Second operand has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) [2025-03-04 00:10:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:29,139 INFO L93 Difference]: Finished difference Result 7803 states and 12009 transitions. [2025-03-04 00:10:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 00:10:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) Word has length 375 [2025-03-04 00:10:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:29,162 INFO L225 Difference]: With dead ends: 7803 [2025-03-04 00:10:29,162 INFO L226 Difference]: Without dead ends: 5200 [2025-03-04 00:10:29,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 00:10:29,168 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1273 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:29,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 2946 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:10:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-04 00:10:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 1932. [2025-03-04 00:10:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1750 states have (on average 1.4942857142857142) internal successors, (2615), 1757 states have internal predecessors, (2615), 141 states have call successors, (141), 40 states have call predecessors, (141), 40 states have return successors, (141), 134 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-04 00:10:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2897 transitions. [2025-03-04 00:10:29,282 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2897 transitions. Word has length 375 [2025-03-04 00:10:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:29,283 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2897 transitions. [2025-03-04 00:10:29,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) [2025-03-04 00:10:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2897 transitions. [2025-03-04 00:10:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:29,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:29,291 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,299 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:10:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:29,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:29,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 136224783, now seen corresponding path program 1 times [2025-03-04 00:10:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461770525] [2025-03-04 00:10:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:29,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:29,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:29,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:29,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:29,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:29,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461770525] [2025-03-04 00:10:29,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461770525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:29,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:29,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671004960] [2025-03-04 00:10:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:29,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:29,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:29,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:29,743 INFO L87 Difference]: Start difference. First operand 1932 states and 2897 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:30,162 INFO L93 Difference]: Finished difference Result 5678 states and 8580 transitions. [2025-03-04 00:10:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:10:30,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 376 [2025-03-04 00:10:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:30,176 INFO L225 Difference]: With dead ends: 5678 [2025-03-04 00:10:30,177 INFO L226 Difference]: Without dead ends: 3825 [2025-03-04 00:10:30,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:10:30,180 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 636 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:30,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 951 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2025-03-04 00:10:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2464. [2025-03-04 00:10:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2268 states have (on average 1.502204585537919) internal successors, (3407), 2277 states have internal predecessors, (3407), 151 states have call successors, (151), 44 states have call predecessors, (151), 44 states have return successors, (151), 142 states have call predecessors, (151), 151 states have call successors, (151) [2025-03-04 00:10:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3709 transitions. [2025-03-04 00:10:30,312 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3709 transitions. Word has length 376 [2025-03-04 00:10:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 3709 transitions. [2025-03-04 00:10:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:10:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3709 transitions. [2025-03-04 00:10:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:30,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:30,317 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:10:30,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2074998066, now seen corresponding path program 1 times [2025-03-04 00:10:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385408862] [2025-03-04 00:10:30,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:30,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:30,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:30,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:30,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385408862] [2025-03-04 00:10:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385408862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348819767] [2025-03-04 00:10:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:31,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:31,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:31,255 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:10:31,256 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:10:31,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:31,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:31,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:31,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:31,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:10:31,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1676 proven. 288 refuted. 0 times theorem prover too weak. 4196 trivial. 0 not checked. [2025-03-04 00:10:32,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 36 proven. 291 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:10:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348819767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:33,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:33,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 35 [2025-03-04 00:10:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661089963] [2025-03-04 00:10:33,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 00:10:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 00:10:33,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:10:33,496 INFO L87 Difference]: Start difference. First operand 2464 states and 3709 transitions. Second operand has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) [2025-03-04 00:10:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:38,254 INFO L93 Difference]: Finished difference Result 9952 states and 15012 transitions. [2025-03-04 00:10:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 00:10:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) Word has length 376 [2025-03-04 00:10:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:38,275 INFO L225 Difference]: With dead ends: 9952 [2025-03-04 00:10:38,275 INFO L226 Difference]: Without dead ends: 7567 [2025-03-04 00:10:38,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3039 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=8412, Unknown=0, NotChecked=0, Total=10712 [2025-03-04 00:10:38,281 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 5820 mSDsluCounter, 6659 mSDsCounter, 0 mSdLazyCounter, 6453 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5828 SdHoareTripleChecker+Valid, 7323 SdHoareTripleChecker+Invalid, 6870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 6453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:38,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5828 Valid, 7323 Invalid, 6870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 6453 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-04 00:10:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2025-03-04 00:10:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 2391. [2025-03-04 00:10:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2212 states have (on average 1.5090415913200723) internal successors, (3338), 2218 states have internal predecessors, (3338), 136 states have call successors, (136), 42 states have call predecessors, (136), 42 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:10:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3610 transitions. [2025-03-04 00:10:38,461 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3610 transitions. Word has length 376 [2025-03-04 00:10:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:38,462 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3610 transitions. [2025-03-04 00:10:38,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) [2025-03-04 00:10:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3610 transitions. [2025-03-04 00:10:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:38,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:38,472 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:38,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:10:38,673 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,SelfDestructingSolverStorable12 [2025-03-04 00:10:38,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1648304690, now seen corresponding path program 1 times [2025-03-04 00:10:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157690014] [2025-03-04 00:10:38,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157690014] [2025-03-04 00:10:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157690014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:39,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:10:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328034248] [2025-03-04 00:10:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:39,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:10:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:39,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:10:39,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:39,313 INFO L87 Difference]: Start difference. First operand 2391 states and 3610 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:40,287 INFO L93 Difference]: Finished difference Result 6370 states and 9653 transitions. [2025-03-04 00:10:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:10:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 376 [2025-03-04 00:10:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:40,296 INFO L225 Difference]: With dead ends: 6370 [2025-03-04 00:10:40,296 INFO L226 Difference]: Without dead ends: 4058 [2025-03-04 00:10:40,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:10:40,300 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 2120 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:40,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 1138 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:10:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-03-04 00:10:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 2847. [2025-03-04 00:10:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2648 states have (on average 1.5018882175226587) internal successors, (3977), 2656 states have internal predecessors, (3977), 150 states have call successors, (150), 48 states have call predecessors, (150), 48 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:10:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4277 transitions. [2025-03-04 00:10:40,467 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4277 transitions. Word has length 376 [2025-03-04 00:10:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:40,469 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 4277 transitions. [2025-03-04 00:10:40,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4277 transitions. [2025-03-04 00:10:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:40,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:40,475 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:10:40,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1636988563, now seen corresponding path program 1 times [2025-03-04 00:10:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802688801] [2025-03-04 00:10:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:40,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:40,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:40,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:10:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802688801] [2025-03-04 00:10:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802688801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:10:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390303609] [2025-03-04 00:10:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:10:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:40,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:10:40,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:10:40,970 INFO L87 Difference]: Start difference. First operand 2847 states and 4277 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:42,107 INFO L93 Difference]: Finished difference Result 6597 states and 9962 transitions. [2025-03-04 00:10:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:10:42,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 376 [2025-03-04 00:10:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:42,115 INFO L225 Difference]: With dead ends: 6597 [2025-03-04 00:10:42,115 INFO L226 Difference]: Without dead ends: 3829 [2025-03-04 00:10:42,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:10:42,118 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2177 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:42,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 1559 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:10:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2025-03-04 00:10:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 2771. [2025-03-04 00:10:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2572 states have (on average 1.5011664074650077) internal successors, (3861), 2580 states have internal predecessors, (3861), 150 states have call successors, (150), 48 states have call predecessors, (150), 48 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:10:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4161 transitions. [2025-03-04 00:10:42,226 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4161 transitions. Word has length 376 [2025-03-04 00:10:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:42,227 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 4161 transitions. [2025-03-04 00:10:42,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-04 00:10:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4161 transitions. [2025-03-04 00:10:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:42,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:42,231 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:10:42,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371762, now seen corresponding path program 1 times [2025-03-04 00:10:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078412879] [2025-03-04 00:10:42,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:42,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:42,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:42,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:42,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078412879] [2025-03-04 00:10:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078412879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396220363] [2025-03-04 00:10:42,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:42,553 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:10:42,554 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:10:42,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:42,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:10:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2013 proven. 132 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2025-03-04 00:10:43,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:10:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396220363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:43,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:43,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-03-04 00:10:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568205807] [2025-03-04 00:10:43,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:43,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:10:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:43,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:10:43,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:43,293 INFO L87 Difference]: Start difference. First operand 2771 states and 4161 transitions. Second operand has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) [2025-03-04 00:10:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:43,718 INFO L93 Difference]: Finished difference Result 5479 states and 8216 transitions. [2025-03-04 00:10:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:10:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) Word has length 376 [2025-03-04 00:10:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:43,726 INFO L225 Difference]: With dead ends: 5479 [2025-03-04 00:10:43,726 INFO L226 Difference]: Without dead ends: 2787 [2025-03-04 00:10:43,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:10:43,730 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 449 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:43,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 540 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-03-04 00:10:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2453. [2025-03-04 00:10:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2244 states have (on average 1.4696969696969697) internal successors, (3298), 2252 states have internal predecessors, (3298), 150 states have call successors, (150), 58 states have call predecessors, (150), 58 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 00:10:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3598 transitions. [2025-03-04 00:10:43,843 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3598 transitions. Word has length 376 [2025-03-04 00:10:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:43,843 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3598 transitions. [2025-03-04 00:10:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) [2025-03-04 00:10:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3598 transitions. [2025-03-04 00:10:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:43,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:43,848 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:10:44,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:44,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 493372685, now seen corresponding path program 1 times [2025-03-04 00:10:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939511072] [2025-03-04 00:10:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:44,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:44,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:44,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:44,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 63 proven. 414 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-03-04 00:10:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939511072] [2025-03-04 00:10:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939511072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307970871] [2025-03-04 00:10:44,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:44,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:44,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:44,786 INFO L229 MonitoredProcess]: Starting monitored process 8 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:10:44,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:10:44,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:45,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:10:45,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1727 proven. 417 refuted. 0 times theorem prover too weak. 4016 trivial. 0 not checked. [2025-03-04 00:10:46,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 426 refuted. 0 times theorem prover too weak. 5674 trivial. 0 not checked. [2025-03-04 00:10:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307970871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:10:46,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:10:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2025-03-04 00:10:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3978012] [2025-03-04 00:10:46,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:46,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 00:10:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:46,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 00:10:46,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:10:46,523 INFO L87 Difference]: Start difference. First operand 2453 states and 3598 transitions. Second operand has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) [2025-03-04 00:10:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:47,910 INFO L93 Difference]: Finished difference Result 5699 states and 8490 transitions. [2025-03-04 00:10:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 00:10:47,911 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) Word has length 376 [2025-03-04 00:10:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:47,918 INFO L225 Difference]: With dead ends: 5699 [2025-03-04 00:10:47,918 INFO L226 Difference]: Without dead ends: 3333 [2025-03-04 00:10:47,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=779, Invalid=2191, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 00:10:47,922 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1368 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:47,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 1598 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:10:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2025-03-04 00:10:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 1122. [2025-03-04 00:10:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 971 states have (on average 1.439752832131823) internal successors, (1398), 974 states have internal predecessors, (1398), 111 states have call successors, (111), 39 states have call predecessors, (111), 39 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-04 00:10:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1620 transitions. [2025-03-04 00:10:47,995 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1620 transitions. Word has length 376 [2025-03-04 00:10:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1620 transitions. [2025-03-04 00:10:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) [2025-03-04 00:10:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1620 transitions. [2025-03-04 00:10:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:47,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:47,999 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:48,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:48,200 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:48,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2046784709, now seen corresponding path program 1 times [2025-03-04 00:10:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097813007] [2025-03-04 00:10:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:48,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:48,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:48,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 87 proven. 390 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-03-04 00:10:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097813007] [2025-03-04 00:10:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097813007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278873081] [2025-03-04 00:10:49,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:49,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:49,038 INFO L229 MonitoredProcess]: Starting monitored process 9 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:10:49,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:10:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:49,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:49,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:49,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:49,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 00:10:49,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3097 proven. 606 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [2025-03-04 00:10:51,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278873081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:00,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:11:00,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 36 [2025-03-04 00:11:00,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446024879] [2025-03-04 00:11:00,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:00,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 00:11:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:00,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 00:11:00,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2362, Unknown=1, NotChecked=0, Total=2862 [2025-03-04 00:11:00,206 INFO L87 Difference]: Start difference. First operand 1122 states and 1620 transitions. Second operand has 36 states, 35 states have (on average 5.228571428571429) internal successors, (183), 34 states have internal predecessors, (183), 9 states have call successors, (108), 6 states have call predecessors, (108), 9 states have return successors, (108), 8 states have call predecessors, (108), 9 states have call successors, (108) [2025-03-04 00:11:15,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]