./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label42.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 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:31:30,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:31:31,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:31:31,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:31:31,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:31:31,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:31:31,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:31:31,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:31:31,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:31:31,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:31:31,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:31:31,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:31:31,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:31:31,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:31:31,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:31:31,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:31:31,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:31:31,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:31:31,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:31:31,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:31:31,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:31,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:31:31,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:31:31,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:31:31,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:31:31,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:31:31,060 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 -> 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 [2025-03-16 15:31:31,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:31:31,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:31:31,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:31:31,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:31:31,311 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:31:31,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2025-03-16 15:31:32,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc0f38e0/fb851b8c10414c46835c1dbaac7eb58d/FLAG82821c043 [2025-03-16 15:31:33,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:31:33,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2025-03-16 15:31:33,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc0f38e0/fb851b8c10414c46835c1dbaac7eb58d/FLAG82821c043 [2025-03-16 15:31:33,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc0f38e0/fb851b8c10414c46835c1dbaac7eb58d [2025-03-16 15:31:33,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:31:33,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:31:33,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:33,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:31:33,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:31:33,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:33" (1/1) ... [2025-03-16 15:31:33,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bc331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:33, skipping insertion in model container [2025-03-16 15:31:33,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:33" (1/1) ... [2025-03-16 15:31:33,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:31:33,842 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_label42.c[1692,1705] [2025-03-16 15:31:34,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:34,603 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:31:34,612 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_label42.c[1692,1705] [2025-03-16 15:31:35,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:35,155 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:31:35,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35 WrapperNode [2025-03-16 15:31:35,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:35,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:35,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:31:35,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:31:35,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:35,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:35,707 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:31:35,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:35,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:31:35,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:31:35,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:31:35,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:35,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:35,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,065 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-16 15:31:36,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:31:36,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:31:36,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:31:36,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:31:36,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (1/1) ... [2025-03-16 15:31:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:31:36,567 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-16 15:31:36,571 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-16 15:31:36,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:31:36,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:31:36,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:31:36,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:31:36,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:31:36,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:31:42,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:31:42,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:31:42,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:31:42,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:31:42,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:31:42,514 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:31:42,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:31:42,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:31:42,555 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:31:42,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:42 BoogieIcfgContainer [2025-03-16 15:31:42,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:31:42,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:31:42,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:31:42,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:31:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:31:33" (1/3) ... [2025-03-16 15:31:42,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:42, skipping insertion in model container [2025-03-16 15:31:42,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:35" (2/3) ... [2025-03-16 15:31:42,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2798250b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:42, skipping insertion in model container [2025-03-16 15:31:42,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:42" (3/3) ... [2025-03-16 15:31:42,568 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label42.c [2025-03-16 15:31:42,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:31:42,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label42.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:31:42,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:31:42,666 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;@6240ba49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:31:42,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:31:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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-16 15:31:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 15:31:42,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:42,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:42,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:42,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1130835414, now seen corresponding path program 1 times [2025-03-16 15:31:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108903838] [2025-03-16 15:31:42,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:42,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:42,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 15:31:42,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 15:31:42,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:42,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:42,803 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-16 15:31:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108903838] [2025-03-16 15:31:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108903838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061127094] [2025-03-16 15:31:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:42,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:31:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:42,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:31:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:42,826 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-16 15:31:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:42,913 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:31:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:31:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-16 15:31:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:42,937 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:31:42,938 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:31:42,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:42,947 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:42,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:31:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:31:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:31:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 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-16 15:31:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:31:43,042 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 8 [2025-03-16 15:31:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:43,042 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:31:43,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-16 15:31:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:31:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 15:31:43,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:43,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:43,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:31:43,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:43,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1131789687, now seen corresponding path program 1 times [2025-03-16 15:31:43,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:43,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529981678] [2025-03-16 15:31:43,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:43,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 15:31:43,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 15:31:43,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:43,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:43,118 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-16 15:31:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529981678] [2025-03-16 15:31:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529981678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429208669] [2025-03-16 15:31:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:43,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:43,121 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-16 15:31:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:47,996 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2025-03-16 15:31:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:47,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-03-16 15:31:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:48,023 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 15:31:48,028 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 15:31:48,031 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-16 15:31:48,032 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1540 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:48,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1392 Invalid, 5628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:31:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 15:31:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2025-03-16 15:31:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 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-16 15:31:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2025-03-16 15:31:48,087 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 8 [2025-03-16 15:31:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:48,088 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2025-03-16 15:31:48,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-16 15:31:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2025-03-16 15:31:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 15:31:48,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:48,089 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:31:48,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:31:48,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:48,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash -157280345, now seen corresponding path program 1 times [2025-03-16 15:31:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389896907] [2025-03-16 15:31:48,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:48,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 15:31:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 15:31:48,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389896907] [2025-03-16 15:31:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389896907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:48,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814987639] [2025-03-16 15:31:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:48,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:48,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:48,288 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 15:31:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:52,947 INFO L93 Difference]: Finished difference Result 9096 states and 15083 transitions. [2025-03-16 15:31:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:52,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2025-03-16 15:31:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:52,969 INFO L225 Difference]: With dead ends: 9096 [2025-03-16 15:31:52,969 INFO L226 Difference]: Without dead ends: 5992 [2025-03-16 15:31:52,973 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-16 15:31:52,976 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:52,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 989 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:31:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-16 15:31:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5990. [2025-03-16 15:31:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5989 states have (on average 1.606278176657205) internal successors, (9620), 5989 states have internal predecessors, (9620), 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-16 15:31:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9620 transitions. [2025-03-16 15:31:53,071 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9620 transitions. Word has length 77 [2025-03-16 15:31:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9620 transitions. [2025-03-16 15:31:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-16 15:31:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9620 transitions. [2025-03-16 15:31:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 15:31:53,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:53,074 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:31:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:31:53,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -156442867, now seen corresponding path program 1 times [2025-03-16 15:31:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:53,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939633874] [2025-03-16 15:31:53,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 15:31:53,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 15:31:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:53,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939633874] [2025-03-16 15:31:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939633874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:53,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952597461] [2025-03-16 15:31:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:53,233 INFO L87 Difference]: Start difference. First operand 5990 states and 9620 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 15:31:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:57,576 INFO L93 Difference]: Finished difference Result 17558 states and 28307 transitions. [2025-03-16 15:31:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82 [2025-03-16 15:31:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:57,604 INFO L225 Difference]: With dead ends: 17558 [2025-03-16 15:31:57,605 INFO L226 Difference]: Without dead ends: 11569 [2025-03-16 15:31:57,613 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-16 15:31:57,613 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:57,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1731 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 15:31:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11569 states. [2025-03-16 15:31:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11569 to 11516. [2025-03-16 15:31:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11516 states, 11515 states have (on average 1.4297003907946157) internal successors, (16463), 11515 states have internal predecessors, (16463), 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-16 15:31:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11516 states to 11516 states and 16463 transitions. [2025-03-16 15:31:57,895 INFO L78 Accepts]: Start accepts. Automaton has 11516 states and 16463 transitions. Word has length 82 [2025-03-16 15:31:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:57,896 INFO L471 AbstractCegarLoop]: Abstraction has 11516 states and 16463 transitions. [2025-03-16 15:31:57,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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-16 15:31:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11516 states and 16463 transitions. [2025-03-16 15:31:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:31:57,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:57,900 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:31:57,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:31:57,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:57,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1109254241, now seen corresponding path program 1 times [2025-03-16 15:31:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097095259] [2025-03-16 15:31:57,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:57,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:31:57,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:31:57,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:57,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:58,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:58,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097095259] [2025-03-16 15:31:58,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097095259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:58,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:58,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778960315] [2025-03-16 15:31:58,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:58,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:58,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:58,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:58,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:58,140 INFO L87 Difference]: Start difference. First operand 11516 states and 16463 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-16 15:32:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:02,888 INFO L93 Difference]: Finished difference Result 34167 states and 48910 transitions. [2025-03-16 15:32:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2025-03-16 15:32:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:02,929 INFO L225 Difference]: With dead ends: 34167 [2025-03-16 15:32:02,929 INFO L226 Difference]: Without dead ends: 22652 [2025-03-16 15:32:02,939 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-16 15:32:02,940 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:02,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2075 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:32:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2025-03-16 15:32:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 21270. [2025-03-16 15:32:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21270 states, 21269 states have (on average 1.2866613380977008) internal successors, (27366), 21269 states have internal predecessors, (27366), 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-16 15:32:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21270 states to 21270 states and 27366 transitions. [2025-03-16 15:32:03,197 INFO L78 Accepts]: Start accepts. Automaton has 21270 states and 27366 transitions. Word has length 105 [2025-03-16 15:32:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 21270 states and 27366 transitions. [2025-03-16 15:32:03,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-16 15:32:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21270 states and 27366 transitions. [2025-03-16 15:32:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 15:32:03,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:03,201 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:32:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:32:03,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 501946783, now seen corresponding path program 1 times [2025-03-16 15:32:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86013837] [2025-03-16 15:32:03,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:03,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 15:32:03,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 15:32:03,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:03,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:32:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:03,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86013837] [2025-03-16 15:32:03,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86013837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:03,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:03,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:32:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208510202] [2025-03-16 15:32:03,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:03,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:03,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:03,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:03,339 INFO L87 Difference]: Start difference. First operand 21270 states and 27366 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-16 15:32:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:08,179 INFO L93 Difference]: Finished difference Result 63158 states and 81268 transitions. [2025-03-16 15:32:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:08,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-03-16 15:32:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:08,234 INFO L225 Difference]: With dead ends: 63158 [2025-03-16 15:32:08,235 INFO L226 Difference]: Without dead ends: 41889 [2025-03-16 15:32:08,249 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-16 15:32:08,249 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 1469 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:08,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1885 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:32:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41889 states. [2025-03-16 15:32:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41889 to 41837. [2025-03-16 15:32:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41837 states, 41836 states have (on average 1.1881154986136342) internal successors, (49706), 41836 states have internal predecessors, (49706), 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-16 15:32:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41837 states to 41837 states and 49706 transitions. [2025-03-16 15:32:08,614 INFO L78 Accepts]: Start accepts. Automaton has 41837 states and 49706 transitions. Word has length 146 [2025-03-16 15:32:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:08,614 INFO L471 AbstractCegarLoop]: Abstraction has 41837 states and 49706 transitions. [2025-03-16 15:32:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-16 15:32:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41837 states and 49706 transitions. [2025-03-16 15:32:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-16 15:32:08,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:08,616 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:32:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:32:08,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -564747660, now seen corresponding path program 1 times [2025-03-16 15:32:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891600272] [2025-03-16 15:32:08,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:08,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-16 15:32:08,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-16 15:32:08,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:08,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:32:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891600272] [2025-03-16 15:32:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891600272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856685375] [2025-03-16 15:32:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:08,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:08,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:08,922 INFO L87 Difference]: Start difference. First operand 41837 states and 49706 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 15:32:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:13,383 INFO L93 Difference]: Finished difference Result 102809 states and 123627 transitions. [2025-03-16 15:32:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 215 [2025-03-16 15:32:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:13,447 INFO L225 Difference]: With dead ends: 102809 [2025-03-16 15:32:13,447 INFO L226 Difference]: Without dead ends: 59606 [2025-03-16 15:32:13,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:13,471 INFO L435 NwaCegarLoop]: 3087 mSDtfsCounter, 1471 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 3276 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:13,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 3276 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1895 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:32:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59606 states. [2025-03-16 15:32:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59606 to 59595. [2025-03-16 15:32:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59595 states, 59594 states have (on average 1.1474477296372119) internal successors, (68381), 59594 states have internal predecessors, (68381), 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-16 15:32:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59595 states to 59595 states and 68381 transitions. [2025-03-16 15:32:14,129 INFO L78 Accepts]: Start accepts. Automaton has 59595 states and 68381 transitions. Word has length 215 [2025-03-16 15:32:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:14,129 INFO L471 AbstractCegarLoop]: Abstraction has 59595 states and 68381 transitions. [2025-03-16 15:32:14,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-16 15:32:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 59595 states and 68381 transitions. [2025-03-16 15:32:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-16 15:32:14,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:14,139 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 15:32:14,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:32:14,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:14,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:14,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1760987227, now seen corresponding path program 1 times [2025-03-16 15:32:14,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:14,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506061428] [2025-03-16 15:32:14,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:14,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-16 15:32:14,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-16 15:32:14,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 15:32:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506061428] [2025-03-16 15:32:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506061428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:15,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135998232] [2025-03-16 15:32:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:15,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:15,294 INFO L87 Difference]: Start difference. First operand 59595 states and 68381 transitions. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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-16 15:32:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:21,985 INFO L93 Difference]: Finished difference Result 146571 states and 166169 transitions. [2025-03-16 15:32:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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 434 [2025-03-16 15:32:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:22,096 INFO L225 Difference]: With dead ends: 146571 [2025-03-16 15:32:22,096 INFO L226 Difference]: Without dead ends: 86977 [2025-03-16 15:32:22,245 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-16 15:32:22,246 INFO L435 NwaCegarLoop]: 1796 mSDtfsCounter, 3759 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9421 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 9421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:22,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3759 Valid, 2152 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 9421 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-16 15:32:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86977 states. [2025-03-16 15:32:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86977 to 84202. [2025-03-16 15:32:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84202 states, 84201 states have (on average 1.117896462037268) internal successors, (94128), 84201 states have internal predecessors, (94128), 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-16 15:32:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84202 states to 84202 states and 94128 transitions. [2025-03-16 15:32:22,858 INFO L78 Accepts]: Start accepts. Automaton has 84202 states and 94128 transitions. Word has length 434 [2025-03-16 15:32:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 84202 states and 94128 transitions. [2025-03-16 15:32:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 3 states have internal predecessors, (428), 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-16 15:32:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 84202 states and 94128 transitions. [2025-03-16 15:32:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-16 15:32:22,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:22,863 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:22,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:32:22,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash -619857683, now seen corresponding path program 1 times [2025-03-16 15:32:22,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:22,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460478912] [2025-03-16 15:32:22,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:22,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-16 15:32:22,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-16 15:32:22,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:22,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:32:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460478912] [2025-03-16 15:32:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460478912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:23,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:23,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372661275] [2025-03-16 15:32:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:23,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:23,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:23,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:23,587 INFO L87 Difference]: Start difference. First operand 84202 states and 94128 transitions. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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-16 15:32:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:27,968 INFO L93 Difference]: Finished difference Result 171164 states and 191034 transitions. [2025-03-16 15:32:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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 462 [2025-03-16 15:32:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:28,058 INFO L225 Difference]: With dead ends: 171164 [2025-03-16 15:32:28,058 INFO L226 Difference]: Without dead ends: 86932 [2025-03-16 15:32:28,091 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-16 15:32:28,095 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5709 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 5717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:28,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1946 Invalid, 5717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5709 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:32:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86932 states. [2025-03-16 15:32:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86932 to 86932. [2025-03-16 15:32:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86932 states, 86931 states have (on average 1.114251532824884) internal successors, (96863), 86931 states have internal predecessors, (96863), 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-16 15:32:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86932 states to 86932 states and 96863 transitions. [2025-03-16 15:32:28,858 INFO L78 Accepts]: Start accepts. Automaton has 86932 states and 96863 transitions. Word has length 462 [2025-03-16 15:32:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:28,858 INFO L471 AbstractCegarLoop]: Abstraction has 86932 states and 96863 transitions. [2025-03-16 15:32:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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-16 15:32:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 86932 states and 96863 transitions. [2025-03-16 15:32:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-16 15:32:28,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:28,861 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:32:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:32:28,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 515127239, now seen corresponding path program 1 times [2025-03-16 15:32:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849452080] [2025-03-16 15:32:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:28,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-16 15:32:28,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-16 15:32:28,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:28,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:32:29,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:29,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849452080] [2025-03-16 15:32:29,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849452080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:29,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:29,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:32:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922886456] [2025-03-16 15:32:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:29,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:29,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:29,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:29,247 INFO L87 Difference]: Start difference. First operand 86932 states and 96863 transitions. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 2 states have internal predecessors, (497), 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-16 15:32:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:34,249 INFO L93 Difference]: Finished difference Result 190272 states and 212623 transitions. [2025-03-16 15:32:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 2 states have internal predecessors, (497), 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 580 [2025-03-16 15:32:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:34,362 INFO L225 Difference]: With dead ends: 190272 [2025-03-16 15:32:34,362 INFO L226 Difference]: Without dead ends: 106071 [2025-03-16 15:32:34,397 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-16 15:32:34,398 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1386 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:34,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 750 Invalid, 5593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1668 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:32:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106071 states. [2025-03-16 15:32:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106071 to 106048. [2025-03-16 15:32:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106048 states, 106047 states have (on average 1.0970324478768847) internal successors, (116337), 106047 states have internal predecessors, (116337), 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-16 15:32:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106048 states to 106048 states and 116337 transitions. [2025-03-16 15:32:35,518 INFO L78 Accepts]: Start accepts. Automaton has 106048 states and 116337 transitions. Word has length 580 [2025-03-16 15:32:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:35,519 INFO L471 AbstractCegarLoop]: Abstraction has 106048 states and 116337 transitions. [2025-03-16 15:32:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 2 states have internal predecessors, (497), 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-16 15:32:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 106048 states and 116337 transitions. [2025-03-16 15:32:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-03-16 15:32:35,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:35,522 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:32:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:32:35,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 396925244, now seen corresponding path program 1 times [2025-03-16 15:32:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:35,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809600522] [2025-03-16 15:32:35,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:35,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-03-16 15:32:35,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-03-16 15:32:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:32:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809600522] [2025-03-16 15:32:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809600522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:32:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715957516] [2025-03-16 15:32:36,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:36,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:32:36,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:32:36,635 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-16 15:32:36,637 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-16 15:32:36,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-03-16 15:32:36,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-03-16 15:32:36,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:36,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:36,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:32:36,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:32:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:32:36,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:32:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715957516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:36,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:32:36,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:32:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53063666] [2025-03-16 15:32:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:36,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:36,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:36,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:36,875 INFO L87 Difference]: Start difference. First operand 106048 states and 116337 transitions. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-16 15:32:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:42,156 INFO L93 Difference]: Finished difference Result 261372 states and 289197 transitions. [2025-03-16 15:32:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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 714 [2025-03-16 15:32:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:42,343 INFO L225 Difference]: With dead ends: 261372 [2025-03-16 15:32:42,343 INFO L226 Difference]: Without dead ends: 158055 [2025-03-16 15:32:42,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:42,407 INFO L435 NwaCegarLoop]: 3208 mSDtfsCounter, 1467 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 6082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:42,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 3380 Invalid, 6082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 15:32:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158055 states. [2025-03-16 15:32:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158055 to 153844. [2025-03-16 15:32:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153844 states, 153843 states have (on average 1.0858602601353329) internal successors, (167052), 153843 states have internal predecessors, (167052), 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-16 15:32:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153844 states to 153844 states and 167052 transitions. [2025-03-16 15:32:44,145 INFO L78 Accepts]: Start accepts. Automaton has 153844 states and 167052 transitions. Word has length 714 [2025-03-16 15:32:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:44,146 INFO L471 AbstractCegarLoop]: Abstraction has 153844 states and 167052 transitions. [2025-03-16 15:32:44,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-16 15:32:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 153844 states and 167052 transitions. [2025-03-16 15:32:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-16 15:32:44,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:44,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:32:44,161 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-16 15:32:44,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:32:44,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:44,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1927536856, now seen corresponding path program 1 times [2025-03-16 15:32:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096889306] [2025-03-16 15:32:44,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:44,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-16 15:32:44,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-16 15:32:44,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:44,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:32:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096889306] [2025-03-16 15:32:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096889306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:44,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:32:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409761575] [2025-03-16 15:32:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:44,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:44,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:44,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:44,879 INFO L87 Difference]: Start difference. First operand 153844 states and 167052 transitions. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 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-16 15:32:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:53,605 INFO L93 Difference]: Finished difference Result 492247 states and 539358 transitions. [2025-03-16 15:32:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 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 792 [2025-03-16 15:32:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:54,346 INFO L225 Difference]: With dead ends: 492247 [2025-03-16 15:32:54,346 INFO L226 Difference]: Without dead ends: 341134 [2025-03-16 15:32:54,398 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-16 15:32:54,399 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 3338 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 8815 mSolverCounterSat, 3022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3338 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 11837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3022 IncrementalHoareTripleChecker+Valid, 8815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:54,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3338 Valid, 1050 Invalid, 11837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3022 Valid, 8815 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-03-16 15:32:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341134 states.