./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9f42a9141f5d3d49aa20951207b54cc4d50d743ec8b66259a20f5b675f4712f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:09:41,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:09:41,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:09:41,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:09:41,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:09:41,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:09:41,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:09:41,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:09:41,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:09:41,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:09:41,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:09:41,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:09:41,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:09:41,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:09:41,467 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:09:41,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:09:41,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:09:41,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:09:41,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:09:41,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:09:41,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:09:41,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:09:41,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:09:41,470 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 -> d9f42a9141f5d3d49aa20951207b54cc4d50d743ec8b66259a20f5b675f4712f [2025-03-17 00:09:41,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:09:41,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:09:41,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:09:41,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:09:41,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:09:41,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i [2025-03-17 00:09:42,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880118510/b4bb4019cab448ce8ecadfe8af01babd/FLAG7140f7b49 [2025-03-17 00:09:43,148 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:09:43,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i [2025-03-17 00:09:43,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880118510/b4bb4019cab448ce8ecadfe8af01babd/FLAG7140f7b49 [2025-03-17 00:09:43,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880118510/b4bb4019cab448ce8ecadfe8af01babd [2025-03-17 00:09:43,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:09:43,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:09:43,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:09:43,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:09:43,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:09:43,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43, skipping insertion in model container [2025-03-17 00:09:43,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:09:43,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i[916,929] [2025-03-17 00:09:43,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:09:43,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:09:43,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-74.i[916,929] [2025-03-17 00:09:43,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:09:43,815 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:09:43,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43 WrapperNode [2025-03-17 00:09:43,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:09:43,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:09:43,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:09:43,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:09:43,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,887 INFO L138 Inliner]: procedures = 26, calls = 100, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2025-03-17 00:09:43,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:09:43,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:09:43,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:09:43,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:09:43,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,924 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-17 00:09:43,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:09:43,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:09:43,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:09:43,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:09:43,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (1/1) ... [2025-03-17 00:09:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:09:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:09:43,981 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-17 00:09:43,984 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-17 00:09:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:09:43,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:09:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:09:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:09:43,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:09:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:09:44,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:09:44,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:09:44,650 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1; [2025-03-17 00:09:44,730 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 00:09:44,731 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:09:44,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:09:44,784 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 00:09:44,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:09:44 BoogieIcfgContainer [2025-03-17 00:09:44,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:09:44,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:09:44,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:09:44,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:09:44,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:09:43" (1/3) ... [2025-03-17 00:09:44,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43be11ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:09:44, skipping insertion in model container [2025-03-17 00:09:44,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:09:43" (2/3) ... [2025-03-17 00:09:44,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43be11ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:09:44, skipping insertion in model container [2025-03-17 00:09:44,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:09:44" (3/3) ... [2025-03-17 00:09:44,791 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-74.i [2025-03-17 00:09:44,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:09:44,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-74.i that has 2 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:09:44,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:09:44,855 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;@f7902a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:09:44,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:09:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 155 states have (on average 1.5354838709677419) internal successors, (238), 156 states have internal predecessors, (238), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:09:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:09:44,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:44,885 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:44,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:44,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash -978541317, now seen corresponding path program 1 times [2025-03-17 00:09:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535600821] [2025-03-17 00:09:44,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:44,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:09:45,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:09:45,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:45,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-17 00:09:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535600821] [2025-03-17 00:09:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535600821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:09:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231084724] [2025-03-17 00:09:45,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:09:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:09:45,390 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-17 00:09:45,392 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-17 00:09:45,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:09:45,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:09:45,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:45,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:45,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:09:45,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:09:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-17 00:09:45,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:09:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231084724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:45,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:09:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:09:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835585678] [2025-03-17 00:09:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:09:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:45,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:09:45,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:09:45,735 INFO L87 Difference]: Start difference. First operand has 245 states, 155 states have (on average 1.5354838709677419) internal successors, (238), 156 states have internal predecessors, (238), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:09:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:45,784 INFO L93 Difference]: Finished difference Result 486 states and 907 transitions. [2025-03-17 00:09:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:09:45,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) Word has length 532 [2025-03-17 00:09:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:45,791 INFO L225 Difference]: With dead ends: 486 [2025-03-17 00:09:45,792 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 00:09:45,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 533 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-17 00:09:45,796 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:45,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:09:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 00:09:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-17 00:09:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 153 states have internal predecessors, (230), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:09:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 404 transitions. [2025-03-17 00:09:45,854 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 404 transitions. Word has length 532 [2025-03-17 00:09:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:45,854 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 404 transitions. [2025-03-17 00:09:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:09:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 404 transitions. [2025-03-17 00:09:45,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:09:45,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:45,864 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:45,872 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-17 00:09:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:09:46,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1578318130, now seen corresponding path program 1 times [2025-03-17 00:09:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663743827] [2025-03-17 00:09:46,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:46,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:09:46,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:09:46,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663743827] [2025-03-17 00:09:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663743827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:09:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044588741] [2025-03-17 00:09:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:46,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:09:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:46,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:09:46,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:09:46,487 INFO L87 Difference]: Start difference. First operand 242 states and 404 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:46,585 INFO L93 Difference]: Finished difference Result 627 states and 1049 transitions. [2025-03-17 00:09:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:09:46,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 532 [2025-03-17 00:09:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:46,593 INFO L225 Difference]: With dead ends: 627 [2025-03-17 00:09:46,594 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 00:09:46,595 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-17 00:09:46,596 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 241 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:46,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 878 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:09:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 00:09:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2025-03-17 00:09:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 265 states have (on average 1.5547169811320756) internal successors, (412), 266 states have internal predecessors, (412), 115 states have call successors, (115), 2 states have call predecessors, (115), 2 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-17 00:09:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 642 transitions. [2025-03-17 00:09:46,654 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 642 transitions. Word has length 532 [2025-03-17 00:09:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:46,656 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 642 transitions. [2025-03-17 00:09:46,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 642 transitions. [2025-03-17 00:09:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:09:46,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:46,660 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:46,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:09:46,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:46,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1129621491, now seen corresponding path program 1 times [2025-03-17 00:09:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587681472] [2025-03-17 00:09:46,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:46,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:46,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:09:46,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:09:46,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:46,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587681472] [2025-03-17 00:09:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587681472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:09:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948372576] [2025-03-17 00:09:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:09:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:09:46,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:09:46,929 INFO L87 Difference]: Start difference. First operand 383 states and 642 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:47,009 INFO L93 Difference]: Finished difference Result 772 states and 1288 transitions. [2025-03-17 00:09:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:09:47,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 532 [2025-03-17 00:09:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:47,014 INFO L225 Difference]: With dead ends: 772 [2025-03-17 00:09:47,014 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 00:09:47,015 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-17 00:09:47,015 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:47,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 774 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:09:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 00:09:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 268. [2025-03-17 00:09:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 178 states have (on average 1.5168539325842696) internal successors, (270), 178 states have internal predecessors, (270), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:09:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 444 transitions. [2025-03-17 00:09:47,046 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 444 transitions. Word has length 532 [2025-03-17 00:09:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:47,048 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 444 transitions. [2025-03-17 00:09:47,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 444 transitions. [2025-03-17 00:09:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:09:47,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:47,052 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:47,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:09:47,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:47,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2139853806, now seen corresponding path program 1 times [2025-03-17 00:09:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870484630] [2025-03-17 00:09:47,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:47,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:09:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:09:47,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:47,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:47,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870484630] [2025-03-17 00:09:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870484630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:47,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:09:47,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565594856] [2025-03-17 00:09:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:47,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:09:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:47,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:09:47,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:09:47,300 INFO L87 Difference]: Start difference. First operand 268 states and 444 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:47,368 INFO L93 Difference]: Finished difference Result 790 states and 1308 transitions. [2025-03-17 00:09:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:09:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 532 [2025-03-17 00:09:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:47,374 INFO L225 Difference]: With dead ends: 790 [2025-03-17 00:09:47,374 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 00:09:47,375 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-17 00:09:47,375 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 381 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:47,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1048 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:09:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 00:09:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 310. [2025-03-17 00:09:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:09:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 520 transitions. [2025-03-17 00:09:47,407 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 520 transitions. Word has length 532 [2025-03-17 00:09:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:47,408 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 520 transitions. [2025-03-17 00:09:47,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 520 transitions. [2025-03-17 00:09:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-17 00:09:47,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:47,411 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:47,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:09:47,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:47,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1700713852, now seen corresponding path program 1 times [2025-03-17 00:09:47,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:47,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557689067] [2025-03-17 00:09:47,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:47,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-17 00:09:47,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-17 00:09:47,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:47,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557689067] [2025-03-17 00:09:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557689067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:47,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:09:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999529932] [2025-03-17 00:09:47,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:47,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:09:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:47,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:09:47,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:09:47,668 INFO L87 Difference]: Start difference. First operand 310 states and 520 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:47,713 INFO L93 Difference]: Finished difference Result 652 states and 1084 transitions. [2025-03-17 00:09:47,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:09:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 533 [2025-03-17 00:09:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:47,717 INFO L225 Difference]: With dead ends: 652 [2025-03-17 00:09:47,717 INFO L226 Difference]: Without dead ends: 343 [2025-03-17 00:09:47,718 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-17 00:09:47,718 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 43 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:47,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 777 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:09:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-17 00:09:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2025-03-17 00:09:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 241 states have (on average 1.5435684647302905) internal successors, (372), 242 states have internal predecessors, (372), 95 states have call successors, (95), 3 states have call predecessors, (95), 3 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-17 00:09:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2025-03-17 00:09:47,740 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 533 [2025-03-17 00:09:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:47,741 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2025-03-17 00:09:47,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2025-03-17 00:09:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-17 00:09:47,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:47,746 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:09:47,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -106740611, now seen corresponding path program 1 times [2025-03-17 00:09:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987422356] [2025-03-17 00:09:47,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:47,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-17 00:09:47,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-17 00:09:47,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987422356] [2025-03-17 00:09:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987422356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:09:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780603744] [2025-03-17 00:09:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:48,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:09:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:48,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:09:48,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:09:48,228 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:09:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:48,841 INFO L93 Difference]: Finished difference Result 1226 states and 2017 transitions. [2025-03-17 00:09:48,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:09:48,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 533 [2025-03-17 00:09:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:48,850 INFO L225 Difference]: With dead ends: 1226 [2025-03-17 00:09:48,850 INFO L226 Difference]: Without dead ends: 887 [2025-03-17 00:09:48,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:09:48,852 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 584 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:48,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1565 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:09:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-03-17 00:09:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 882. [2025-03-17 00:09:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 625 states have (on average 1.5312) internal successors, (957), 629 states have internal predecessors, (957), 247 states have call successors, (247), 9 states have call predecessors, (247), 9 states have return successors, (247), 243 states have call predecessors, (247), 247 states have call successors, (247) [2025-03-17 00:09:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1451 transitions. [2025-03-17 00:09:48,935 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1451 transitions. Word has length 533 [2025-03-17 00:09:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1451 transitions. [2025-03-17 00:09:48,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:09:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1451 transitions. [2025-03-17 00:09:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-17 00:09:48,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:48,941 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:09:48,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1103812964, now seen corresponding path program 1 times [2025-03-17 00:09:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:48,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683627331] [2025-03-17 00:09:48,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-17 00:09:49,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-17 00:09:49,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:49,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683627331] [2025-03-17 00:09:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683627331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:09:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052562654] [2025-03-17 00:09:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:09:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:49,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:09:49,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:09:49,655 INFO L87 Difference]: Start difference. First operand 882 states and 1451 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:50,302 INFO L93 Difference]: Finished difference Result 3328 states and 5361 transitions. [2025-03-17 00:09:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:09:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 533 [2025-03-17 00:09:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:50,315 INFO L225 Difference]: With dead ends: 3328 [2025-03-17 00:09:50,315 INFO L226 Difference]: Without dead ends: 2447 [2025-03-17 00:09:50,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:09:50,318 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 789 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:50,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1528 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:09:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-17 00:09:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 1628. [2025-03-17 00:09:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1209 states have (on average 1.5616211745244004) internal successors, (1888), 1219 states have internal predecessors, (1888), 400 states have call successors, (400), 18 states have call predecessors, (400), 18 states have return successors, (400), 390 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-17 00:09:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2688 transitions. [2025-03-17 00:09:50,427 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2688 transitions. Word has length 533 [2025-03-17 00:09:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:50,428 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2688 transitions. [2025-03-17 00:09:50,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:09:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2688 transitions. [2025-03-17 00:09:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-17 00:09:50,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:50,432 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:09:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:09:50,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1948284835, now seen corresponding path program 1 times [2025-03-17 00:09:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288980251] [2025-03-17 00:09:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:50,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-17 00:09:50,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-17 00:09:50,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:09:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288980251] [2025-03-17 00:09:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288980251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:09:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310145072] [2025-03-17 00:09:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:59,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:09:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:59,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:09:59,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:09:59,626 INFO L87 Difference]: Start difference. First operand 1628 states and 2688 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2025-03-17 00:10:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:04,628 INFO L93 Difference]: Finished difference Result 8436 states and 13936 transitions. [2025-03-17 00:10:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:10:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) Word has length 533 [2025-03-17 00:10:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:04,657 INFO L225 Difference]: With dead ends: 8436 [2025-03-17 00:10:04,658 INFO L226 Difference]: Without dead ends: 6809 [2025-03-17 00:10:04,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:10:04,664 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 2160 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:04,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 1988 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 00:10:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2025-03-17 00:10:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 4120. [2025-03-17 00:10:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 3305 states have (on average 1.5915279878971256) internal successors, (5260), 3339 states have internal predecessors, (5260), 772 states have call successors, (772), 42 states have call predecessors, (772), 42 states have return successors, (772), 738 states have call predecessors, (772), 772 states have call successors, (772) [2025-03-17 00:10:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 6804 transitions. [2025-03-17 00:10:05,025 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 6804 transitions. Word has length 533 [2025-03-17 00:10:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:05,026 INFO L471 AbstractCegarLoop]: Abstraction has 4120 states and 6804 transitions. [2025-03-17 00:10:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2025-03-17 00:10:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 6804 transitions. [2025-03-17 00:10:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-17 00:10:05,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:05,033 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:05,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:10:05,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:05,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2026496547, now seen corresponding path program 1 times [2025-03-17 00:10:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933560247] [2025-03-17 00:10:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-17 00:10:05,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-17 00:10:05,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:05,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:10:05,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:05,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933560247] [2025-03-17 00:10:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933560247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:10:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052889489] [2025-03-17 00:10:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:10:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:05,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:10:05,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:10:05,723 INFO L87 Difference]: Start difference. First operand 4120 states and 6804 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:06,493 INFO L93 Difference]: Finished difference Result 10731 states and 17789 transitions. [2025-03-17 00:10:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:10:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 533 [2025-03-17 00:10:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:06,525 INFO L225 Difference]: With dead ends: 10731 [2025-03-17 00:10:06,525 INFO L226 Difference]: Without dead ends: 6612 [2025-03-17 00:10:06,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:10:06,537 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 340 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:06,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1355 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:10:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2025-03-17 00:10:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 5872. [2025-03-17 00:10:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 4965 states have (on average 1.6489425981873111) internal successors, (8187), 4999 states have internal predecessors, (8187), 859 states have call successors, (859), 47 states have call predecessors, (859), 47 states have return successors, (859), 825 states have call predecessors, (859), 859 states have call successors, (859) [2025-03-17 00:10:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 9905 transitions. [2025-03-17 00:10:06,998 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 9905 transitions. Word has length 533 [2025-03-17 00:10:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 5872 states and 9905 transitions. [2025-03-17 00:10:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 9905 transitions. [2025-03-17 00:10:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-17 00:10:07,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:07,006 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:10:07,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash 70874538, now seen corresponding path program 1 times [2025-03-17 00:10:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461070526] [2025-03-17 00:10:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:07,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-17 00:10:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-17 00:10:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:10:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461070526] [2025-03-17 00:10:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461070526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:10:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629149911] [2025-03-17 00:10:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:07,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:10:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:07,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:10:07,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:10:07,804 INFO L87 Difference]: Start difference. First operand 5872 states and 9905 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:08,745 INFO L93 Difference]: Finished difference Result 10731 states and 17771 transitions. [2025-03-17 00:10:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:10:08,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 534 [2025-03-17 00:10:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:08,787 INFO L225 Difference]: With dead ends: 10731 [2025-03-17 00:10:08,787 INFO L226 Difference]: Without dead ends: 6612 [2025-03-17 00:10:08,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:10:08,800 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 338 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:08,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1565 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:10:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2025-03-17 00:10:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 5890. [2025-03-17 00:10:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5890 states, 4983 states have (on average 1.6465984346779048) internal successors, (8205), 5017 states have internal predecessors, (8205), 859 states have call successors, (859), 47 states have call predecessors, (859), 47 states have return successors, (859), 825 states have call predecessors, (859), 859 states have call successors, (859) [2025-03-17 00:10:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 9923 transitions. [2025-03-17 00:10:09,178 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 9923 transitions. Word has length 534 [2025-03-17 00:10:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:09,179 INFO L471 AbstractCegarLoop]: Abstraction has 5890 states and 9923 transitions. [2025-03-17 00:10:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 9923 transitions. [2025-03-17 00:10:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-17 00:10:09,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:09,186 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:10:09,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -439659639, now seen corresponding path program 1 times [2025-03-17 00:10:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:09,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068968960] [2025-03-17 00:10:09,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:09,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-17 00:10:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-17 00:10:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:10:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:09,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068968960] [2025-03-17 00:10:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068968960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:10:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787453762] [2025-03-17 00:10:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:10:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:09,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:10:09,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:10:09,883 INFO L87 Difference]: Start difference. First operand 5890 states and 9923 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:10,438 INFO L93 Difference]: Finished difference Result 10135 states and 16924 transitions. [2025-03-17 00:10:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:10:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 534 [2025-03-17 00:10:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:10,463 INFO L225 Difference]: With dead ends: 10135 [2025-03-17 00:10:10,463 INFO L226 Difference]: Without dead ends: 6016 [2025-03-17 00:10:10,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-17 00:10:10,473 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 390 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:10,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1845 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:10:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2025-03-17 00:10:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 5890. [2025-03-17 00:10:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5890 states, 4983 states have (on average 1.6393738711619505) internal successors, (8169), 5017 states have internal predecessors, (8169), 859 states have call successors, (859), 47 states have call predecessors, (859), 47 states have return successors, (859), 825 states have call predecessors, (859), 859 states have call successors, (859) [2025-03-17 00:10:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 9887 transitions. [2025-03-17 00:10:10,845 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 9887 transitions. Word has length 534 [2025-03-17 00:10:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:10,845 INFO L471 AbstractCegarLoop]: Abstraction has 5890 states and 9887 transitions. [2025-03-17 00:10:10,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:10:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 9887 transitions. [2025-03-17 00:10:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:10:10,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:10,852 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:10:10,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2005595650, now seen corresponding path program 1 times [2025-03-17 00:10:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345170509] [2025-03-17 00:10:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:10,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:10,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:10,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:10,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 30 proven. 228 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345170509] [2025-03-17 00:10:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345170509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786106446] [2025-03-17 00:10:11,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:11,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:11,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:11,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:11,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:10:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:11,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:11,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:11,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:11,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:10:11,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 6162 proven. 72 refuted. 0 times theorem prover too weak. 8730 trivial. 0 not checked. [2025-03-17 00:10:12,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:10:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 186 proven. 72 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786106446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:10:13,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:10:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 20 [2025-03-17 00:10:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303945500] [2025-03-17 00:10:13,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:10:13,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 00:10:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:13,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 00:10:13,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:10:13,348 INFO L87 Difference]: Start difference. First operand 5890 states and 9887 transitions. Second operand has 20 states, 19 states have (on average 15.0) internal successors, (285), 20 states have internal predecessors, (285), 8 states have call successors, (261), 3 states have call predecessors, (261), 6 states have return successors, (261), 7 states have call predecessors, (261), 8 states have call successors, (261) [2025-03-17 00:10:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:23,275 INFO L93 Difference]: Finished difference Result 39549 states and 62131 transitions. [2025-03-17 00:10:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-03-17 00:10:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 15.0) internal successors, (285), 20 states have internal predecessors, (285), 8 states have call successors, (261), 3 states have call predecessors, (261), 6 states have return successors, (261), 7 states have call predecessors, (261), 8 states have call successors, (261) Word has length 536 [2025-03-17 00:10:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:23,392 INFO L225 Difference]: With dead ends: 39549 [2025-03-17 00:10:23,392 INFO L226 Difference]: Without dead ends: 35016 [2025-03-17 00:10:23,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1903, Invalid=7217, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 00:10:23,411 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 3618 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 4990 mSolverCounterSat, 2819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3679 SdHoareTripleChecker+Valid, 4092 SdHoareTripleChecker+Invalid, 7809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2819 IncrementalHoareTripleChecker+Valid, 4990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:23,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3679 Valid, 4092 Invalid, 7809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2819 Valid, 4990 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 00:10:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35016 states. [2025-03-17 00:10:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35016 to 22151. [2025-03-17 00:10:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22151 states, 17385 states have (on average 1.4991659476560253) internal successors, (26063), 17669 states have internal predecessors, (26063), 4371 states have call successors, (4371), 394 states have call predecessors, (4371), 394 states have return successors, (4371), 4087 states have call predecessors, (4371), 4371 states have call successors, (4371) [2025-03-17 00:10:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22151 states to 22151 states and 34805 transitions. [2025-03-17 00:10:26,547 INFO L78 Accepts]: Start accepts. Automaton has 22151 states and 34805 transitions. Word has length 536 [2025-03-17 00:10:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:26,548 INFO L471 AbstractCegarLoop]: Abstraction has 22151 states and 34805 transitions. [2025-03-17 00:10:26,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 15.0) internal successors, (285), 20 states have internal predecessors, (285), 8 states have call successors, (261), 3 states have call predecessors, (261), 6 states have return successors, (261), 7 states have call predecessors, (261), 8 states have call successors, (261) [2025-03-17 00:10:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 22151 states and 34805 transitions. [2025-03-17 00:10:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:10:26,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:26,562 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:26,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:10:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 00:10:26,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1436016512, now seen corresponding path program 1 times [2025-03-17 00:10:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139479252] [2025-03-17 00:10:26,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:26,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:26,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:26,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 132 proven. 126 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139479252] [2025-03-17 00:10:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139479252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343143700] [2025-03-17 00:10:27,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:27,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:27,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:27,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:10:27,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:27,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:27,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:27,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:10:27,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7566 proven. 126 refuted. 0 times theorem prover too weak. 7272 trivial. 0 not checked. [2025-03-17 00:10:27,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:10:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 132 proven. 126 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343143700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:10:27,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:10:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 00:10:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839765439] [2025-03-17 00:10:27,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:10:27,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:10:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:27,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:10:27,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:10:27,966 INFO L87 Difference]: Start difference. First operand 22151 states and 34805 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-17 00:10:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:29,582 INFO L93 Difference]: Finished difference Result 34223 states and 53612 transitions. [2025-03-17 00:10:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:10:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) Word has length 536 [2025-03-17 00:10:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:29,634 INFO L225 Difference]: With dead ends: 34223 [2025-03-17 00:10:29,634 INFO L226 Difference]: Without dead ends: 15955 [2025-03-17 00:10:29,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1069 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:10:29,669 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 382 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:29,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 720 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:10:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15955 states. [2025-03-17 00:10:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15955 to 11097. [2025-03-17 00:10:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11097 states, 8502 states have (on average 1.4645965655139968) internal successors, (12452), 8642 states have internal predecessors, (12452), 2367 states have call successors, (2367), 227 states have call predecessors, (2367), 227 states have return successors, (2367), 2227 states have call predecessors, (2367), 2367 states have call successors, (2367) [2025-03-17 00:10:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 17186 transitions. [2025-03-17 00:10:31,579 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 17186 transitions. Word has length 536 [2025-03-17 00:10:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:31,580 INFO L471 AbstractCegarLoop]: Abstraction has 11097 states and 17186 transitions. [2025-03-17 00:10:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-17 00:10:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 17186 transitions. [2025-03-17 00:10:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:10:31,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:31,591 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:31,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:10:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:31,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 820894495, now seen corresponding path program 1 times [2025-03-17 00:10:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575188224] [2025-03-17 00:10:31,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:31,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:31,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:31,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:31,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 135 proven. 123 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575188224] [2025-03-17 00:10:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575188224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587531431] [2025-03-17 00:10:32,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:32,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:32,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:10:32,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:32,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:32,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:32,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:32,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1162 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:10:32,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7556 proven. 123 refuted. 0 times theorem prover too weak. 7285 trivial. 0 not checked. [2025-03-17 00:10:32,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:10:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 135 proven. 123 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587531431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:10:33,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:10:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 00:10:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902607314] [2025-03-17 00:10:33,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:10:33,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:10:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:33,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:10:33,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:10:33,275 INFO L87 Difference]: Start difference. First operand 11097 states and 17186 transitions. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 2 states have call successors, (128), 2 states have call predecessors, (128), 4 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) [2025-03-17 00:10:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:41,285 INFO L93 Difference]: Finished difference Result 53196 states and 79464 transitions. [2025-03-17 00:10:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-17 00:10:41,286 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 2 states have call successors, (128), 2 states have call predecessors, (128), 4 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) Word has length 536 [2025-03-17 00:10:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:41,467 INFO L225 Difference]: With dead ends: 53196 [2025-03-17 00:10:41,467 INFO L226 Difference]: Without dead ends: 43787 [2025-03-17 00:10:41,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1072 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=407, Invalid=1153, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 00:10:41,508 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1871 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:41,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 1938 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:10:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43787 states. [2025-03-17 00:10:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43787 to 21665. [2025-03-17 00:10:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21665 states, 16776 states have (on average 1.4636385312350977) internal successors, (24554), 17060 states have internal predecessors, (24554), 4419 states have call successors, (4419), 469 states have call predecessors, (4419), 469 states have return successors, (4419), 4135 states have call predecessors, (4419), 4419 states have call successors, (4419) [2025-03-17 00:10:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21665 states to 21665 states and 33392 transitions. [2025-03-17 00:10:44,717 INFO L78 Accepts]: Start accepts. Automaton has 21665 states and 33392 transitions. Word has length 536 [2025-03-17 00:10:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:44,718 INFO L471 AbstractCegarLoop]: Abstraction has 21665 states and 33392 transitions. [2025-03-17 00:10:44,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 2 states have call successors, (128), 2 states have call predecessors, (128), 4 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) [2025-03-17 00:10:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21665 states and 33392 transitions. [2025-03-17 00:10:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:10:44,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:44,729 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:44,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 00:10:44,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:44,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:44,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1256314848, now seen corresponding path program 1 times [2025-03-17 00:10:44,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024163979] [2025-03-17 00:10:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:44,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:45,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 141 proven. 117 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024163979] [2025-03-17 00:10:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024163979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:10:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275661765] [2025-03-17 00:10:45,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:10:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:10:45,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:10:45,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:10:45,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:45,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:45,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:45,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:45,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:10:45,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:10:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7512 proven. 117 refuted. 0 times theorem prover too weak. 7335 trivial. 0 not checked. [2025-03-17 00:10:45,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:10:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 141 proven. 117 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:10:45,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275661765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:10:45,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:10:45,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 00:10:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961534810] [2025-03-17 00:10:45,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:10:45,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:10:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:45,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:10:45,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:10:45,999 INFO L87 Difference]: Start difference. First operand 21665 states and 33392 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2025-03-17 00:10:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:10:48,948 INFO L93 Difference]: Finished difference Result 38747 states and 58841 transitions. [2025-03-17 00:10:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:10:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) Word has length 536 [2025-03-17 00:10:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:10:49,140 INFO L225 Difference]: With dead ends: 38747 [2025-03-17 00:10:49,140 INFO L226 Difference]: Without dead ends: 18355 [2025-03-17 00:10:49,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1069 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:10:49,170 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 220 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:10:49,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 952 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:10:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18355 states. [2025-03-17 00:10:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18355 to 17739. [2025-03-17 00:10:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 13407 states have (on average 1.4161259043783099) internal successors, (18986), 13655 states have internal predecessors, (18986), 3906 states have call successors, (3906), 425 states have call predecessors, (3906), 425 states have return successors, (3906), 3658 states have call predecessors, (3906), 3906 states have call successors, (3906) [2025-03-17 00:10:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 26798 transitions. [2025-03-17 00:10:52,054 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 26798 transitions. Word has length 536 [2025-03-17 00:10:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:10:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 17739 states and 26798 transitions. [2025-03-17 00:10:52,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 2 states have call predecessors, (127), 2 states have call successors, (127) [2025-03-17 00:10:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 26798 transitions. [2025-03-17 00:10:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:10:52,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:10:52,066 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:10:52,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 00:10:52,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 00:10:52,267 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:10:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:10:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1666402271, now seen corresponding path program 1 times [2025-03-17 00:10:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:10:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468613356] [2025-03-17 00:10:52,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:10:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:10:52,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:10:52,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:10:52,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:10:52,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:10:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:10:55,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:10:55,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468613356] [2025-03-17 00:10:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468613356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:10:55,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:10:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:10:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740877028] [2025-03-17 00:10:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:10:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:10:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:10:55,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:10:55,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:10:55,142 INFO L87 Difference]: Start difference. First operand 17739 states and 26798 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87)