./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label22.c --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/eca-rers2012/Problem19_label22.c -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 52a7ff7e330f46b869a7b98caac05f71580ce2ae239ad7bf01fc1c01c2bc4ab9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:10:42,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:10:42,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:10:42,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:10:42,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:10:42,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:10:42,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:10:42,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:10:42,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:10:42,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:10:42,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:10:42,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:10:42,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:10:42,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:10:42,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:10:42,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:10:42,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:10:42,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:10:42,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:10:42,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:10:42,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:10:42,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:10:42,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:10:42,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:10:42,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:10:42,655 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 -> 52a7ff7e330f46b869a7b98caac05f71580ce2ae239ad7bf01fc1c01c2bc4ab9 [2025-03-03 11:10:42,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:10:42,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:10:42,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:10:42,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:10:42,927 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:10:42,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label22.c [2025-03-03 11:10:44,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc51e722/7191fc24bdad456f98276f48338b6321/FLAG3453c8ab0 [2025-03-03 11:10:44,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:10:44,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label22.c [2025-03-03 11:10:44,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc51e722/7191fc24bdad456f98276f48338b6321/FLAG3453c8ab0 [2025-03-03 11:10:44,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc51e722/7191fc24bdad456f98276f48338b6321 [2025-03-03 11:10:44,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:10:44,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:10:44,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:10:44,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:10:44,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:10:44,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:10:44" (1/1) ... [2025-03-03 11:10:44,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702cacba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:44, skipping insertion in model container [2025-03-03 11:10:44,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:10:44" (1/1) ... [2025-03-03 11:10:44,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:10:44,904 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/eca-rers2012/Problem19_label22.c[4094,4107] [2025-03-03 11:10:45,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:10:45,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:10:45,609 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/eca-rers2012/Problem19_label22.c[4094,4107] [2025-03-03 11:10:46,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:10:46,104 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:10:46,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46 WrapperNode [2025-03-03 11:10:46,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:10:46,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:10:46,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:10:46,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:10:46,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:46,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:46,803 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-03 11:10:46,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:10:46,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:10:46,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:10:46,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:10:46,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:46,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,237 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-03 11:10:47,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:10:47,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:10:47,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:10:47,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:10:47,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (1/1) ... [2025-03-03 11:10:47,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:10:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:10:47,588 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-03 11:10:47,591 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-03 11:10:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:10:47,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:10:47,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:10:47,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:10:47,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:10:47,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:10:53,204 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-03 11:10:53,204 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-03 11:10:53,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-03 11:10:53,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-03 11:10:53,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-03 11:10:53,393 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-03 11:10:53,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:10:53,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:10:53,439 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:10:53,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:10:53 BoogieIcfgContainer [2025-03-03 11:10:53,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:10:53,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:10:53,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:10:53,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:10:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:10:44" (1/3) ... [2025-03-03 11:10:53,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4daeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:10:53, skipping insertion in model container [2025-03-03 11:10:53,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:10:46" (2/3) ... [2025-03-03 11:10:53,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4daeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:10:53, skipping insertion in model container [2025-03-03 11:10:53,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:10:53" (3/3) ... [2025-03-03 11:10:53,449 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label22.c [2025-03-03 11:10:53,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:10:53,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label22.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:10:53,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:10:53,556 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;@5559754e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:10:53,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:10:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 11:10:53,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:53,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-03 11:10:53,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash -149863906, now seen corresponding path program 1 times [2025-03-03 11:10:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714927047] [2025-03-03 11:10:53,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:53,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 11:10:53,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 11:10:53,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:10:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714927047] [2025-03-03 11:10:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714927047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:53,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:10:53,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377944067] [2025-03-03 11:10:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:10:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:53,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:10:53,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:53,834 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:10:59,207 INFO L93 Difference]: Finished difference Result 4975 states and 9413 transitions. [2025-03-03 11:10:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:10:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 11:10:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:10:59,237 INFO L225 Difference]: With dead ends: 4975 [2025-03-03 11:10:59,238 INFO L226 Difference]: Without dead ends: 3163 [2025-03-03 11:10:59,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:10:59,247 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1517 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:10:59,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1530 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 11:10:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2025-03-03 11:10:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2025-03-03 11:10:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2025-03-03 11:10:59,373 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 29 [2025-03-03 11:10:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:10:59,373 INFO L471 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2025-03-03 11:10:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:10:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2025-03-03 11:10:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 11:10:59,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:10:59,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:10:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:10:59,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:10:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:10:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -955252502, now seen corresponding path program 1 times [2025-03-03 11:10:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:10:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803429003] [2025-03-03 11:10:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:10:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:10:59,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 11:10:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 11:10:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:10:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:10:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:10:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:10:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803429003] [2025-03-03 11:10:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803429003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:10:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:10:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:10:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833128354] [2025-03-03 11:10:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:10:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:10:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:10:59,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:10:59,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:10:59,814 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:06,856 INFO L93 Difference]: Finished difference Result 10375 states and 16597 transitions. [2025-03-03 11:11:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:11:06,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 11:11:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:06,878 INFO L225 Difference]: With dead ends: 10375 [2025-03-03 11:11:06,879 INFO L226 Difference]: Without dead ends: 7254 [2025-03-03 11:11:06,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 11:11:06,884 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 4482 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 2736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 9738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2736 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:06,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 973 Invalid, 9738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2736 Valid, 7002 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-03 11:11:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2025-03-03 11:11:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 7248. [2025-03-03 11:11:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7247 states have (on average 1.4746791775907273) internal successors, (10687), 7247 states have internal predecessors, (10687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 10687 transitions. [2025-03-03 11:11:06,998 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 10687 transitions. Word has length 100 [2025-03-03 11:11:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 10687 transitions. [2025-03-03 11:11:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 10687 transitions. [2025-03-03 11:11:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 11:11:07,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:07,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:11:07,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2096990098, now seen corresponding path program 1 times [2025-03-03 11:11:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15681162] [2025-03-03 11:11:07,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:07,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 11:11:07,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 11:11:07,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:07,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 11:11:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15681162] [2025-03-03 11:11:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15681162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:07,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:11:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307514761] [2025-03-03 11:11:07,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:07,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:11:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:07,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:11:07,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:07,858 INFO L87 Difference]: Start difference. First operand 7248 states and 10687 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:14,803 INFO L93 Difference]: Finished difference Result 20004 states and 31245 transitions. [2025-03-03 11:11:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:11:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 304 [2025-03-03 11:11:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:14,843 INFO L225 Difference]: With dead ends: 20004 [2025-03-03 11:11:14,843 INFO L226 Difference]: Without dead ends: 14123 [2025-03-03 11:11:14,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 11:11:14,851 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 3758 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9440 mSolverCounterSat, 1330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 10770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1330 IncrementalHoareTripleChecker+Valid, 9440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:14,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 2157 Invalid, 10770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1330 Valid, 9440 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-03 11:11:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14123 states. [2025-03-03 11:11:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14123 to 14105. [2025-03-03 11:11:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14104 states have (on average 1.2897050482132728) internal successors, (18190), 14104 states have internal predecessors, (18190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 18190 transitions. [2025-03-03 11:11:15,034 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 18190 transitions. Word has length 304 [2025-03-03 11:11:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:15,035 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 18190 transitions. [2025-03-03 11:11:15,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 18190 transitions. [2025-03-03 11:11:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 11:11:15,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:15,038 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:11:15,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1571489636, now seen corresponding path program 1 times [2025-03-03 11:11:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347104024] [2025-03-03 11:11:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:15,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 11:11:15,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 11:11:15,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:15,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:11:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347104024] [2025-03-03 11:11:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347104024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:11:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654138217] [2025-03-03 11:11:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:15,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:11:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:15,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:11:15,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:15,525 INFO L87 Difference]: Start difference. First operand 14105 states and 18190 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:20,098 INFO L93 Difference]: Finished difference Result 25509 states and 33661 transitions. [2025-03-03 11:11:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:11:20,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-03-03 11:11:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:20,123 INFO L225 Difference]: With dead ends: 25509 [2025-03-03 11:11:20,123 INFO L226 Difference]: Without dead ends: 14105 [2025-03-03 11:11:20,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:20,135 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7317 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 7325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:20,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2113 Invalid, 7325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7317 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:11:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14105 states. [2025-03-03 11:11:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14105 to 14105. [2025-03-03 11:11:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14104 states have (on average 1.2887833238797504) internal successors, (18177), 14104 states have internal predecessors, (18177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 18177 transitions. [2025-03-03 11:11:20,316 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 18177 transitions. Word has length 332 [2025-03-03 11:11:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 18177 transitions. [2025-03-03 11:11:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 18177 transitions. [2025-03-03 11:11:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-03 11:11:20,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:20,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:20,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:11:20,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1877792301, now seen corresponding path program 1 times [2025-03-03 11:11:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874107461] [2025-03-03 11:11:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:20,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-03 11:11:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-03 11:11:20,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:20,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 11:11:20,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:20,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874107461] [2025-03-03 11:11:20,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874107461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:11:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772335536] [2025-03-03 11:11:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:20,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:11:20,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:20,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:11:20,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:20,680 INFO L87 Difference]: Start difference. First operand 14105 states and 18177 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:25,249 INFO L93 Difference]: Finished difference Result 36584 states and 48697 transitions. [2025-03-03 11:11:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:11:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 584 [2025-03-03 11:11:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:25,289 INFO L225 Difference]: With dead ends: 36584 [2025-03-03 11:11:25,289 INFO L226 Difference]: Without dead ends: 25211 [2025-03-03 11:11:25,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:25,299 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 2111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5117 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:25,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 987 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5117 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:11:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25211 states. [2025-03-03 11:11:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25211 to 25208. [2025-03-03 11:11:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25208 states, 25207 states have (on average 1.2882135914626889) internal successors, (32472), 25207 states have internal predecessors, (32472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25208 states to 25208 states and 32472 transitions. [2025-03-03 11:11:25,553 INFO L78 Accepts]: Start accepts. Automaton has 25208 states and 32472 transitions. Word has length 584 [2025-03-03 11:11:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 25208 states and 32472 transitions. [2025-03-03 11:11:25,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 25208 states and 32472 transitions. [2025-03-03 11:11:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 11:11:25,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:25,563 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:25,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:11:25,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:25,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -344069554, now seen corresponding path program 1 times [2025-03-03 11:11:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279681718] [2025-03-03 11:11:25,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:25,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 11:11:25,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 11:11:25,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:25,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 11:11:25,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:25,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279681718] [2025-03-03 11:11:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279681718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:11:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932186678] [2025-03-03 11:11:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:25,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:11:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:25,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:11:25,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:25,986 INFO L87 Difference]: Start difference. First operand 25208 states and 32472 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:30,360 INFO L93 Difference]: Finished difference Result 53167 states and 70386 transitions. [2025-03-03 11:11:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:11:30,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 601 [2025-03-03 11:11:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:30,399 INFO L225 Difference]: With dead ends: 53167 [2025-03-03 11:11:30,399 INFO L226 Difference]: Without dead ends: 30691 [2025-03-03 11:11:30,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:30,418 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1387 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 2136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 6061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2136 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:30,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 752 Invalid, 6061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2136 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 11:11:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30691 states. [2025-03-03 11:11:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30691 to 30678. [2025-03-03 11:11:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30678 states, 30677 states have (on average 1.2795905727417936) internal successors, (39254), 30677 states have internal predecessors, (39254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30678 states to 30678 states and 39254 transitions. [2025-03-03 11:11:30,670 INFO L78 Accepts]: Start accepts. Automaton has 30678 states and 39254 transitions. Word has length 601 [2025-03-03 11:11:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 30678 states and 39254 transitions. [2025-03-03 11:11:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30678 states and 39254 transitions. [2025-03-03 11:11:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-03-03 11:11:30,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:30,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:30,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:11:30,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 423507346, now seen corresponding path program 1 times [2025-03-03 11:11:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945490666] [2025-03-03 11:11:30,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:30,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-03-03 11:11:30,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-03-03 11:11:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:30,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 11:11:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:30,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945490666] [2025-03-03 11:11:30,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945490666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:30,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:11:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752381858] [2025-03-03 11:11:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:30,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:11:30,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:30,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:11:30,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:30,982 INFO L87 Difference]: Start difference. First operand 30678 states and 39254 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:35,679 INFO L93 Difference]: Finished difference Result 84784 states and 110337 transitions. [2025-03-03 11:11:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:11:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 639 [2025-03-03 11:11:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:35,766 INFO L225 Difference]: With dead ends: 84784 [2025-03-03 11:11:35,766 INFO L226 Difference]: Without dead ends: 56838 [2025-03-03 11:11:35,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:11:35,795 INFO L435 NwaCegarLoop]: 1792 mSDtfsCounter, 1350 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 5727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:35,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2061 Invalid, 5727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4297 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:11:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56838 states. [2025-03-03 11:11:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56838 to 55449. [2025-03-03 11:11:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55449 states, 55448 states have (on average 1.1878516808541335) internal successors, (65864), 55448 states have internal predecessors, (65864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55449 states to 55449 states and 65864 transitions. [2025-03-03 11:11:36,445 INFO L78 Accepts]: Start accepts. Automaton has 55449 states and 65864 transitions. Word has length 639 [2025-03-03 11:11:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:36,445 INFO L471 AbstractCegarLoop]: Abstraction has 55449 states and 65864 transitions. [2025-03-03 11:11:36,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 55449 states and 65864 transitions. [2025-03-03 11:11:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-03-03 11:11:36,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:36,458 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:11:36,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1811776864, now seen corresponding path program 1 times [2025-03-03 11:11:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306210443] [2025-03-03 11:11:36,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:36,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-03-03 11:11:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-03-03 11:11:36,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:36,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-03 11:11:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306210443] [2025-03-03 11:11:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306210443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:11:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273599049] [2025-03-03 11:11:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:36,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:11:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:36,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:11:36,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:36,854 INFO L87 Difference]: Start difference. First operand 55449 states and 65864 transitions. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:44,955 INFO L93 Difference]: Finished difference Result 183462 states and 222904 transitions. [2025-03-03 11:11:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:11:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 813 [2025-03-03 11:11:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:45,118 INFO L225 Difference]: With dead ends: 183462 [2025-03-03 11:11:45,119 INFO L226 Difference]: Without dead ends: 130745 [2025-03-03 11:11:45,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:45,146 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3279 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 9135 mSolverCounterSat, 2803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3279 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 11938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2803 IncrementalHoareTripleChecker+Valid, 9135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:45,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3279 Valid, 1179 Invalid, 11938 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2803 Valid, 9135 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-03 11:11:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130745 states. [2025-03-03 11:11:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130745 to 130621. [2025-03-03 11:11:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130621 states, 130620 states have (on average 1.1615296279283418) internal successors, (151719), 130620 states have internal predecessors, (151719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130621 states to 130621 states and 151719 transitions. [2025-03-03 11:11:46,607 INFO L78 Accepts]: Start accepts. Automaton has 130621 states and 151719 transitions. Word has length 813 [2025-03-03 11:11:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:46,608 INFO L471 AbstractCegarLoop]: Abstraction has 130621 states and 151719 transitions. [2025-03-03 11:11:46,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 130621 states and 151719 transitions. [2025-03-03 11:11:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-03 11:11:46,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:46,613 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:46,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:11:46,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:46,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1689538524, now seen corresponding path program 1 times [2025-03-03 11:11:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:46,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777243195] [2025-03-03 11:11:46,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:46,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-03 11:11:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-03 11:11:46,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 165 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:11:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777243195] [2025-03-03 11:11:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777243195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:11:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038949887] [2025-03-03 11:11:48,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:11:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:11:48,393 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-03 11:11:48,394 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-03 11:11:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-03 11:11:48,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-03 11:11:48,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:48,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:48,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:11:48,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:11:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2025-03-03 11:11:48,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:11:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038949887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:11:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 11:11:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519145088] [2025-03-03 11:11:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:11:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:48,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:11:48,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:11:48,681 INFO L87 Difference]: Start difference. First operand 130621 states and 151719 transitions. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:11:53,591 INFO L93 Difference]: Finished difference Result 299584 states and 354554 transitions. [2025-03-03 11:11:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:11:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 831 [2025-03-03 11:11:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:11:53,781 INFO L225 Difference]: With dead ends: 299584 [2025-03-03 11:11:53,781 INFO L226 Difference]: Without dead ends: 171695 [2025-03-03 11:11:53,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:11:53,859 INFO L435 NwaCegarLoop]: 3092 mSDtfsCounter, 1468 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 4177 mSolverCounterSat, 1624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 3267 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1624 IncrementalHoareTripleChecker+Valid, 4177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:11:53,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 3267 Invalid, 5801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1624 Valid, 4177 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 11:11:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171695 states. [2025-03-03 11:11:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171695 to 167497. [2025-03-03 11:11:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167497 states, 167496 states have (on average 1.1581231790609925) internal successors, (193981), 167496 states have internal predecessors, (193981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167497 states to 167497 states and 193981 transitions. [2025-03-03 11:11:55,540 INFO L78 Accepts]: Start accepts. Automaton has 167497 states and 193981 transitions. Word has length 831 [2025-03-03 11:11:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:11:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 167497 states and 193981 transitions. [2025-03-03 11:11:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:11:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 167497 states and 193981 transitions. [2025-03-03 11:11:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2025-03-03 11:11:55,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:11:55,548 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:11:55,555 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-03 11:11:55,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:11:55,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:11:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:11:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash -408270795, now seen corresponding path program 1 times [2025-03-03 11:11:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:11:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588706370] [2025-03-03 11:11:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:11:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:11:55,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 960 statements into 1 equivalence classes. [2025-03-03 11:11:55,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 960 of 960 statements. [2025-03-03 11:11:55,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:11:55,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:11:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-03 11:11:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:11:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588706370] [2025-03-03 11:11:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588706370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:11:56,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:11:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:11:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950666459] [2025-03-03 11:11:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:11:56,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:11:56,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:11:56,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:11:56,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:11:56,450 INFO L87 Difference]: Start difference. First operand 167497 states and 193981 transitions. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:12:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:12:05,129 INFO L93 Difference]: Finished difference Result 501547 states and 595016 transitions. [2025-03-03 11:12:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:12:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 960 [2025-03-03 11:12:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:12:05,495 INFO L225 Difference]: With dead ends: 501547 [2025-03-03 11:12:05,495 INFO L226 Difference]: Without dead ends: 336782 [2025-03-03 11:12:05,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:12:05,545 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 3287 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 6274 mSolverCounterSat, 2909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 9183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2909 IncrementalHoareTripleChecker+Valid, 6274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:12:05,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3287 Valid, 977 Invalid, 9183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2909 Valid, 6274 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-03 11:12:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336782 states.