./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label38.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_label38.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 cf45ccd02a611bb9297bfb1cd355a12d9c6a10c7fde3ac90ab820bcc5d1ae5fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:12:22,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:12:22,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:12:22,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:12:22,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:12:22,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:12:22,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:12:22,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:12:22,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:12:22,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:12:22,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:12:22,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:12:22,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:12:22,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:12:22,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:12:22,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:12:22,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:12:22,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:12:22,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:12:22,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:12:22,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:12:22,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:12:22,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:12:22,463 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 -> cf45ccd02a611bb9297bfb1cd355a12d9c6a10c7fde3ac90ab820bcc5d1ae5fb [2025-03-03 11:12:22,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:12:22,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:12:22,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:12:22,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:12:22,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:12:22,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label38.c [2025-03-03 11:12:23,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9b1235c/f762533d25e94d429439aa00c7558434/FLAG5c43bbf84 [2025-03-03 11:12:24,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:12:24,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label38.c [2025-03-03 11:12:24,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9b1235c/f762533d25e94d429439aa00c7558434/FLAG5c43bbf84 [2025-03-03 11:12:24,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9b1235c/f762533d25e94d429439aa00c7558434 [2025-03-03 11:12:24,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:12:24,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:12:24,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:12:24,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:12:24,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:12:24,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:24" (1/1) ... [2025-03-03 11:12:24,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:24, skipping insertion in model container [2025-03-03 11:12:24,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:12:24" (1/1) ... [2025-03-03 11:12:25,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:12:25,280 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_label38.c[7658,7671] [2025-03-03 11:12:26,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:12:26,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:12:26,046 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_label38.c[7658,7671] [2025-03-03 11:12:26,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:12:26,515 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:12:26,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26 WrapperNode [2025-03-03 11:12:26,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:12:26,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:12:26,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:12:26,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:12:26,521 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:12:26" (1/1) ... [2025-03-03 11:12:26,600 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:12:26" (1/1) ... [2025-03-03 11:12:27,039 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-03 11:12:27,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:12:27,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:12:27,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:12:27,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:12:27,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,507 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:12:27,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:27,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:28,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:28,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:28,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:12:28,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:12:28,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:12:28,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:12:28,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (1/1) ... [2025-03-03 11:12:28,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:12:28,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:12:28,128 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:12:28,130 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:12:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:12:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:12:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:12:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:12:28,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:12:28,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:12:33,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-03 11:12:33,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-03 11:12:33,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-03 11:12:33,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-03 11:12:33,922 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-03 11:12:34,306 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-03 11:12:34,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:12:34,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:12:34,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:12:34,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:34 BoogieIcfgContainer [2025-03-03 11:12:34,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:12:34,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:12:34,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:12:34,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:12:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:12:24" (1/3) ... [2025-03-03 11:12:34,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1010deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:34, skipping insertion in model container [2025-03-03 11:12:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:12:26" (2/3) ... [2025-03-03 11:12:34,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1010deb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:12:34, skipping insertion in model container [2025-03-03 11:12:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:12:34" (3/3) ... [2025-03-03 11:12:34,353 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label38.c [2025-03-03 11:12:34,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:12:34,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label38.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:12:34,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:12:34,444 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@490e1cad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:12:34,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:12:34,453 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:12:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 11:12:34,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:12:34,460 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, 1, 1, 1, 1, 1, 1, 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:12:34,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:12:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:12:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 640031345, now seen corresponding path program 1 times [2025-03-03 11:12:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:12:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469772855] [2025-03-03 11:12:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:12:34,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:12:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 11:12:34,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 11:12:34,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:12:34,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:12:34,925 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:12:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:12:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469772855] [2025-03-03 11:12:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469772855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:12:34,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:12:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:12:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918482722] [2025-03-03 11:12:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:12:34,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:12:34,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:12:34,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:12:34,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:12:34,948 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 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:12:42,952 INFO L93 Difference]: Finished difference Result 6288 states and 12041 transitions. [2025-03-03 11:12:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:12:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2025-03-03 11:12:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:12:42,980 INFO L225 Difference]: With dead ends: 6288 [2025-03-03 11:12:42,980 INFO L226 Difference]: Without dead ends: 4471 [2025-03-03 11:12:42,985 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:12:42,987 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 4566 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 7124 mSolverCounterSat, 3649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4566 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 10773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3649 IncrementalHoareTripleChecker+Valid, 7124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:12:42,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4566 Valid, 1003 Invalid, 10773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3649 Valid, 7124 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-03 11:12:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2025-03-03 11:12:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4467. [2025-03-03 11:12:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4467 states, 4466 states have (on average 1.5665024630541873) internal successors, (6996), 4466 states have internal predecessors, (6996), 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:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 6996 transitions. [2025-03-03 11:12:43,126 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 6996 transitions. Word has length 59 [2025-03-03 11:12:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:12:43,127 INFO L471 AbstractCegarLoop]: Abstraction has 4467 states and 6996 transitions. [2025-03-03 11:12:43,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 6996 transitions. [2025-03-03 11:12:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 11:12:43,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:12:43,139 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:43,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:12:43,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:12:43,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:12:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash 682058820, now seen corresponding path program 1 times [2025-03-03 11:12:43,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:12:43,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651103689] [2025-03-03 11:12:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:12:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:12:43,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 11:12:43,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 11:12:43,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:12:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:12:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 11:12:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:12:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651103689] [2025-03-03 11:12:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651103689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:12:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:12:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:12:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248699602] [2025-03-03 11:12:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:12:44,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:12:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:12:44,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:12:44,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:12:44,028 INFO L87 Difference]: Start difference. First operand 4467 states and 6996 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 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:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:12:51,534 INFO L93 Difference]: Finished difference Result 11710 states and 20221 transitions. [2025-03-03 11:12:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:12:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 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 333 [2025-03-03 11:12:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:12:51,561 INFO L225 Difference]: With dead ends: 11710 [2025-03-03 11:12:51,562 INFO L226 Difference]: Without dead ends: 8610 [2025-03-03 11:12:51,568 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:12:51,569 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9445 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 10776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 9445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:12:51,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2157 Invalid, 10776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 9445 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-03 11:12:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2025-03-03 11:12:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8596. [2025-03-03 11:12:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8596 states, 8595 states have (on average 1.348458406050029) internal successors, (11590), 8595 states have internal predecessors, (11590), 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:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 11590 transitions. [2025-03-03 11:12:51,692 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 11590 transitions. Word has length 333 [2025-03-03 11:12:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:12:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 8596 states and 11590 transitions. [2025-03-03 11:12:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 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:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 11590 transitions. [2025-03-03 11:12:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 11:12:51,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:12:51,699 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:12:51,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:12:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:12:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash -219329834, now seen corresponding path program 1 times [2025-03-03 11:12:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:12:51,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660196499] [2025-03-03 11:12:51,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:12:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:12:51,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 11:12:51,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 11:12:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:12:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:12:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 11:12:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:12:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660196499] [2025-03-03 11:12:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660196499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:12:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:12:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:12:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840082847] [2025-03-03 11:12:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:12:52,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:12:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:12:52,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:12:52,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:12:52,435 INFO L87 Difference]: Start difference. First operand 8596 states and 11590 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 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:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:12:56,607 INFO L93 Difference]: Finished difference Result 14491 states and 20461 transitions. [2025-03-03 11:12:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:12:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 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 361 [2025-03-03 11:12:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:12:56,627 INFO L225 Difference]: With dead ends: 14491 [2025-03-03 11:12:56,627 INFO L226 Difference]: Without dead ends: 8596 [2025-03-03 11:12:56,632 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:12:56,632 INFO L435 NwaCegarLoop]: 1773 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5713 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 5721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:12:56,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1952 Invalid, 5721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5713 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 11:12:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8596 states. [2025-03-03 11:12:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8596 to 8596. [2025-03-03 11:12:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8596 states, 8595 states have (on average 1.3469458987783596) internal successors, (11577), 8595 states have internal predecessors, (11577), 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:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 11577 transitions. [2025-03-03 11:12:56,746 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 11577 transitions. Word has length 361 [2025-03-03 11:12:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:12:56,747 INFO L471 AbstractCegarLoop]: Abstraction has 8596 states and 11577 transitions. [2025-03-03 11:12:56,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 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:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 11577 transitions. [2025-03-03 11:12:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-03 11:12:56,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:12:56,754 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:12:56,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:12:56,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:12:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash -56503579, now seen corresponding path program 1 times [2025-03-03 11:12:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:12:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250090476] [2025-03-03 11:12:56,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:12:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:12:56,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 11:12:56,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 11:12:56,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:12:56,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:12:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 11:12:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:12:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250090476] [2025-03-03 11:12:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250090476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:12:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313827762] [2025-03-03 11:12:57,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:12:57,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:12:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:12:57,441 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:12:57,443 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:12:57,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-03 11:12:57,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-03 11:12:57,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:12:57,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:12:57,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:12:57,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:12:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:12:57,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:12:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313827762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:12:57,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:12:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 11:12:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240665715] [2025-03-03 11:12:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:12:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:12:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:12:57,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:12:57,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:12:57,733 INFO L87 Difference]: Start difference. First operand 8596 states and 11577 transitions. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:13:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:02,096 INFO L93 Difference]: Finished difference Result 19935 states and 28708 transitions. [2025-03-03 11:13:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:13:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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 613 [2025-03-03 11:13:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:02,123 INFO L225 Difference]: With dead ends: 19935 [2025-03-03 11:13:02,123 INFO L226 Difference]: Without dead ends: 14071 [2025-03-03 11:13:02,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:13:02,129 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1730 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:02,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 1504 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 11:13:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14071 states. [2025-03-03 11:13:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14071 to 14071. [2025-03-03 11:13:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14071 states, 14070 states have (on average 1.2694385216773276) internal successors, (17861), 14070 states have internal predecessors, (17861), 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:13:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14071 states to 14071 states and 17861 transitions. [2025-03-03 11:13:02,288 INFO L78 Accepts]: Start accepts. Automaton has 14071 states and 17861 transitions. Word has length 613 [2025-03-03 11:13:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 14071 states and 17861 transitions. [2025-03-03 11:13:02,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:13:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14071 states and 17861 transitions. [2025-03-03 11:13:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-03 11:13:02,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:02,298 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:02,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:13:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:13:02,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:02,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1474512448, now seen corresponding path program 1 times [2025-03-03 11:13:02,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:02,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495476021] [2025-03-03 11:13:02,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:02,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-03 11:13:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-03 11:13:02,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:02,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 11:13:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495476021] [2025-03-03 11:13:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495476021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:02,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:13:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:13:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498367127] [2025-03-03 11:13:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:13:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:02,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:13:02,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:13:02,984 INFO L87 Difference]: Start difference. First operand 14071 states and 17861 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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:13:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:07,692 INFO L93 Difference]: Finished difference Result 36504 states and 47794 transitions. [2025-03-03 11:13:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:13:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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 614 [2025-03-03 11:13:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:07,740 INFO L225 Difference]: With dead ends: 36504 [2025-03-03 11:13:07,740 INFO L226 Difference]: Without dead ends: 25165 [2025-03-03 11:13:07,752 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:13:07,754 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2110 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5095 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 5529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:07,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 963 Invalid, 5529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5095 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 11:13:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25165 states. [2025-03-03 11:13:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25165 to 23797. [2025-03-03 11:13:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23797 states, 23796 states have (on average 1.2674399058665322) internal successors, (30160), 23796 states have internal predecessors, (30160), 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:13:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23797 states to 23797 states and 30160 transitions. [2025-03-03 11:13:08,018 INFO L78 Accepts]: Start accepts. Automaton has 23797 states and 30160 transitions. Word has length 614 [2025-03-03 11:13:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:08,019 INFO L471 AbstractCegarLoop]: Abstraction has 23797 states and 30160 transitions. [2025-03-03 11:13:08,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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:13:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23797 states and 30160 transitions. [2025-03-03 11:13:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-03 11:13:08,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:08,026 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:08,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:13:08,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:08,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 222098081, now seen corresponding path program 1 times [2025-03-03 11:13:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833328404] [2025-03-03 11:13:08,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 11:13:08,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 11:13:08,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:08,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 11:13:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:08,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833328404] [2025-03-03 11:13:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833328404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:13:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:13:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262565623] [2025-03-03 11:13:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:08,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:13:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:08,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:13:08,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:13:08,580 INFO L87 Difference]: Start difference. First operand 23797 states and 30160 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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:13:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:12,641 INFO L93 Difference]: Finished difference Result 50347 states and 65462 transitions. [2025-03-03 11:13:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:13:12,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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 631 [2025-03-03 11:13:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:12,683 INFO L225 Difference]: With dead ends: 50347 [2025-03-03 11:13:12,684 INFO L226 Difference]: Without dead ends: 29282 [2025-03-03 11:13:12,700 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:13:12,700 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1377 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 2125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2125 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:12,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 723 Invalid, 6046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2125 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 11:13:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29282 states. [2025-03-03 11:13:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29282 to 29267. [2025-03-03 11:13:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29267 states, 29266 states have (on average 1.2553133328777422) internal successors, (36738), 29266 states have internal predecessors, (36738), 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:13:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29267 states to 29267 states and 36738 transitions. [2025-03-03 11:13:13,088 INFO L78 Accepts]: Start accepts. Automaton has 29267 states and 36738 transitions. Word has length 631 [2025-03-03 11:13:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:13,090 INFO L471 AbstractCegarLoop]: Abstraction has 29267 states and 36738 transitions. [2025-03-03 11:13:13,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 2 states have internal predecessors, (548), 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:13:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 29267 states and 36738 transitions. [2025-03-03 11:13:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-03-03 11:13:13,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:13,096 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13:13,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:13:13,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:13,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 639711571, now seen corresponding path program 1 times [2025-03-03 11:13:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:13,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909470286] [2025-03-03 11:13:13,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 843 statements into 1 equivalence classes. [2025-03-03 11:13:13,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 843 of 843 statements. [2025-03-03 11:13:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-03 11:13:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909470286] [2025-03-03 11:13:13,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909470286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:13,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:13:13,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:13:13,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162709590] [2025-03-03 11:13:13,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:13:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:13,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:13:13,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:13:13,510 INFO L87 Difference]: Start difference. First operand 29267 states and 36738 transitions. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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:13:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:21,271 INFO L93 Difference]: Finished difference Result 98282 states and 126943 transitions. [2025-03-03 11:13:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:13:21,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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 843 [2025-03-03 11:13:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:21,349 INFO L225 Difference]: With dead ends: 98282 [2025-03-03 11:13:21,349 INFO L226 Difference]: Without dead ends: 71747 [2025-03-03 11:13:21,372 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:13:21,373 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 3272 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 8835 mSolverCounterSat, 2954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 11789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2954 IncrementalHoareTripleChecker+Valid, 8835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:21,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 1134 Invalid, 11789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2954 Valid, 8835 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-03 11:13:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71747 states. [2025-03-03 11:13:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71747 to 68933. [2025-03-03 11:13:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68933 states, 68932 states have (on average 1.223118435559682) internal successors, (84312), 68932 states have internal predecessors, (84312), 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:13:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68933 states to 68933 states and 84312 transitions. [2025-03-03 11:13:21,990 INFO L78 Accepts]: Start accepts. Automaton has 68933 states and 84312 transitions. Word has length 843 [2025-03-03 11:13:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:21,991 INFO L471 AbstractCegarLoop]: Abstraction has 68933 states and 84312 transitions. [2025-03-03 11:13:21,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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:13:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 68933 states and 84312 transitions. [2025-03-03 11:13:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2025-03-03 11:13:22,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:22,000 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:13:22,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:13:22,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:22,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2036095354, now seen corresponding path program 1 times [2025-03-03 11:13:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:22,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928433689] [2025-03-03 11:13:22,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:22,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 919 statements into 1 equivalence classes. [2025-03-03 11:13:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 919 of 919 statements. [2025-03-03 11:13:22,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:22,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-03 11:13:22,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928433689] [2025-03-03 11:13:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928433689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:22,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:13:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:13:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920879538] [2025-03-03 11:13:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:13:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:13:22,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:13:22,693 INFO L87 Difference]: Start difference. First operand 68933 states and 84312 transitions. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:13:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:29,833 INFO L93 Difference]: Finished difference Result 192492 states and 245927 transitions. [2025-03-03 11:13:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:13:29,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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 919 [2025-03-03 11:13:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:29,978 INFO L225 Difference]: With dead ends: 192492 [2025-03-03 11:13:29,978 INFO L226 Difference]: Without dead ends: 126291 [2025-03-03 11:13:30,019 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:13:30,020 INFO L435 NwaCegarLoop]: 2642 mSDtfsCounter, 2860 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 9873 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 11240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 9873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:30,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 3114 Invalid, 11240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 9873 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-03 11:13:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126291 states. [2025-03-03 11:13:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126291 to 126280. [2025-03-03 11:13:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126280 states, 126279 states have (on average 1.24023788595095) internal successors, (156616), 126279 states have internal predecessors, (156616), 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:13:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126280 states to 126280 states and 156616 transitions. [2025-03-03 11:13:31,530 INFO L78 Accepts]: Start accepts. Automaton has 126280 states and 156616 transitions. Word has length 919 [2025-03-03 11:13:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:31,531 INFO L471 AbstractCegarLoop]: Abstraction has 126280 states and 156616 transitions. [2025-03-03 11:13:31,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:13:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126280 states and 156616 transitions. [2025-03-03 11:13:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2025-03-03 11:13:31,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:31,550 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, 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:13:31,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 446398360, now seen corresponding path program 1 times [2025-03-03 11:13:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551027818] [2025-03-03 11:13:31,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:31,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1042 statements into 1 equivalence classes. [2025-03-03 11:13:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1042 of 1042 statements. [2025-03-03 11:13:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 761 proven. 366 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 11:13:33,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551027818] [2025-03-03 11:13:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551027818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:13:33,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122919153] [2025-03-03 11:13:33,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:33,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:13:33,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:13:33,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:13:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:13:33,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1042 statements into 1 equivalence classes. [2025-03-03 11:13:33,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1042 of 1042 statements. [2025-03-03 11:13:33,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:33,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:33,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:13:33,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:13:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-03 11:13:33,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:13:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122919153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:13:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 11:13:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669008876] [2025-03-03 11:13:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:13:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:33,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:13:33,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:13:33,624 INFO L87 Difference]: Start difference. First operand 126280 states and 156616 transitions. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:13:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:13:38,237 INFO L93 Difference]: Finished difference Result 293504 states and 362620 transitions. [2025-03-03 11:13:38,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:13:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 1042 [2025-03-03 11:13:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:13:38,415 INFO L225 Difference]: With dead ends: 293504 [2025-03-03 11:13:38,415 INFO L226 Difference]: Without dead ends: 167224 [2025-03-03 11:13:38,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1047 GetRequests, 1044 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:13:38,472 INFO L435 NwaCegarLoop]: 2588 mSDtfsCounter, 1554 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3790 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 5448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 3790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:13:38,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 2676 Invalid, 5448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 3790 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 11:13:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167224 states. [2025-03-03 11:13:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167224 to 165848. [2025-03-03 11:13:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165848 states, 165847 states have (on average 1.1925027284183616) internal successors, (197773), 165847 states have internal predecessors, (197773), 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:13:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165848 states to 165848 states and 197773 transitions. [2025-03-03 11:13:40,653 INFO L78 Accepts]: Start accepts. Automaton has 165848 states and 197773 transitions. Word has length 1042 [2025-03-03 11:13:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:13:40,654 INFO L471 AbstractCegarLoop]: Abstraction has 165848 states and 197773 transitions. [2025-03-03 11:13:40,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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:13:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 165848 states and 197773 transitions. [2025-03-03 11:13:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1076 [2025-03-03 11:13:40,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:13:40,667 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:13:40,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 11:13:40,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 11:13:40,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:13:40,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:13:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash -440496257, now seen corresponding path program 1 times [2025-03-03 11:13:40,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:13:40,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769114900] [2025-03-03 11:13:40,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:13:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:13:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1075 statements into 1 equivalence classes. [2025-03-03 11:13:40,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1075 of 1075 statements. [2025-03-03 11:13:40,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:13:40,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:13:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-03 11:13:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:13:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769114900] [2025-03-03 11:13:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769114900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:13:41,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:13:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:13:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088883668] [2025-03-03 11:13:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:13:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:13:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:13:41,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:13:41,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:13:41,342 INFO L87 Difference]: Start difference. First operand 165848 states and 197773 transitions. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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)