./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:56:49,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:56:49,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:56:49,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:56:49,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:56:49,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:56:49,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:56:49,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:56:49,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:56:49,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:56:49,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:56:49,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:56:49,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:56:49,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:56:49,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:56:49,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:56:49,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:56:49,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:49,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:56:49,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:56:49,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:56:49,766 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 -> 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 [2025-03-08 10:56:50,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:56:50,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:56:50,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:56:50,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:56:50,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:56:50,026 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-3.i [2025-03-08 10:56:51,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df177b99f/aeecd7f040964e09865ec322e1f6c09c/FLAG30e620e36 [2025-03-08 10:56:51,450 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:56:51,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-08 10:56:51,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df177b99f/aeecd7f040964e09865ec322e1f6c09c/FLAG30e620e36 [2025-03-08 10:56:51,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df177b99f/aeecd7f040964e09865ec322e1f6c09c [2025-03-08 10:56:51,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:56:51,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:56:51,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:51,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:56:51,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:56:51,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:51" (1/1) ... [2025-03-08 10:56:51,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f39d194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:51, skipping insertion in model container [2025-03-08 10:56:51,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:56:51" (1/1) ... [2025-03-08 10:56:51,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:56:51,899 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-3.i[915,928] [2025-03-08 10:56:52,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:52,045 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:56:52,055 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-3.i[915,928] [2025-03-08 10:56:52,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:56:52,109 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:56:52,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52 WrapperNode [2025-03-08 10:56:52,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:56:52,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:52,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:56:52,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:56:52,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,168 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2025-03-08 10:56:52,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:56:52,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:56:52,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:56:52,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:56:52,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,219 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-08 10:56:52,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:56:52,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:56:52,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:56:52,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:56:52,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (1/1) ... [2025-03-08 10:56:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:56:52,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:52,295 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-08 10:56:52,300 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-08 10:56:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:56:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:56:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:56:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:56:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:56:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:56:52,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:56:52,431 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:56:53,047 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc property_#t~bitwise62#1;havoc property_#t~short63#1; [2025-03-08 10:56:53,127 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 10:56:53,127 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:56:53,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:56:53,151 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 10:56:53,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:53 BoogieIcfgContainer [2025-03-08 10:56:53,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:56:53,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:56:53,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:56:53,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:56:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:56:51" (1/3) ... [2025-03-08 10:56:53,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3343cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:53, skipping insertion in model container [2025-03-08 10:56:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:56:52" (2/3) ... [2025-03-08 10:56:53,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3343cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:56:53, skipping insertion in model container [2025-03-08 10:56:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:56:53" (3/3) ... [2025-03-08 10:56:53,158 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-08 10:56:53,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:56:53,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i that has 2 procedures, 253 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:56:53,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:56:53,219 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;@1447abd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:56:53,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:56:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 165 states have internal predecessors, (248), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:56:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 10:56:53,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:53,240 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:53,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:53,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -277147821, now seen corresponding path program 1 times [2025-03-08 10:56:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030624181] [2025-03-08 10:56:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:53,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 10:56:53,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 10:56:53,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:53,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 10:56:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030624181] [2025-03-08 10:56:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030624181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:56:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853379974] [2025-03-08 10:56:53,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:53,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:56:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:56:53,717 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-08 10:56:53,718 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-08 10:56:53,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 10:56:53,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 10:56:53,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:53,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:53,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:56:53,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:56:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 10:56:54,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:56:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853379974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:56:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:56:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81946611] [2025-03-08 10:56:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:54,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:56:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:54,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:56:54,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:56:54,067 INFO L87 Difference]: Start difference. First operand has 253 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 165 states have internal predecessors, (248), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:56:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:54,124 INFO L93 Difference]: Finished difference Result 500 states and 921 transitions. [2025-03-08 10:56:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:56:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-03-08 10:56:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:54,132 INFO L225 Difference]: With dead ends: 500 [2025-03-08 10:56:54,132 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 10:56:54,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 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-08 10:56:54,142 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:54,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 10:56:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-08 10:56:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 162 states have internal predecessors, (241), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:56:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 413 transitions. [2025-03-08 10:56:54,203 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 413 transitions. Word has length 535 [2025-03-08 10:56:54,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:54,203 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 413 transitions. [2025-03-08 10:56:54,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:56:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 413 transitions. [2025-03-08 10:56:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 10:56:54,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:54,211 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:54,219 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-08 10:56:54,412 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-08 10:56:54,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1158457809, now seen corresponding path program 1 times [2025-03-08 10:56:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069598345] [2025-03-08 10:56:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:54,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 10:56:54,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 10:56:54,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069598345] [2025-03-08 10:56:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069598345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144035708] [2025-03-08 10:56:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:55,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:55,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:55,107 INFO L87 Difference]: Start difference. First operand 250 states and 413 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:55,157 INFO L93 Difference]: Finished difference Result 498 states and 825 transitions. [2025-03-08 10:56:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 535 [2025-03-08 10:56:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:55,163 INFO L225 Difference]: With dead ends: 498 [2025-03-08 10:56:55,163 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 10:56:55,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 10:56:55,165 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:55,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 798 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 10:56:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-08 10:56:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 163 states have (on average 1.4846625766871167) internal successors, (242), 163 states have internal predecessors, (242), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:56:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 414 transitions. [2025-03-08 10:56:55,208 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 414 transitions. Word has length 535 [2025-03-08 10:56:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:55,213 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 414 transitions. [2025-03-08 10:56:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 414 transitions. [2025-03-08 10:56:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 10:56:55,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:55,217 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:55,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:56:55,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1530367933, now seen corresponding path program 1 times [2025-03-08 10:56:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419748326] [2025-03-08 10:56:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:55,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 10:56:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 10:56:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419748326] [2025-03-08 10:56:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419748326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873768215] [2025-03-08 10:56:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:55,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:55,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:55,809 INFO L87 Difference]: Start difference. First operand 251 states and 414 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:55,901 INFO L93 Difference]: Finished difference Result 747 states and 1236 transitions. [2025-03-08 10:56:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-08 10:56:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:55,909 INFO L225 Difference]: With dead ends: 747 [2025-03-08 10:56:55,910 INFO L226 Difference]: Without dead ends: 499 [2025-03-08 10:56:55,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 10:56:55,911 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 224 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:55,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 801 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:56:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-08 10:56:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2025-03-08 10:56:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 322 states have internal predecessors, (476), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-08 10:56:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 820 transitions. [2025-03-08 10:56:55,978 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 820 transitions. Word has length 537 [2025-03-08 10:56:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:55,979 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 820 transitions. [2025-03-08 10:56:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 820 transitions. [2025-03-08 10:56:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-08 10:56:55,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:55,983 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:55,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:56:55,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:55,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash 290199752, now seen corresponding path program 1 times [2025-03-08 10:56:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361484134] [2025-03-08 10:56:55,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:56,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 10:56:56,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 10:56:56,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:56,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361484134] [2025-03-08 10:56:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361484134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991216384] [2025-03-08 10:56:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:56,161 INFO L87 Difference]: Start difference. First operand 497 states and 820 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:56,232 INFO L93 Difference]: Finished difference Result 1055 states and 1732 transitions. [2025-03-08 10:56:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 538 [2025-03-08 10:56:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:56,239 INFO L225 Difference]: With dead ends: 1055 [2025-03-08 10:56:56,240 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 10:56:56,243 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-08 10:56:56,244 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 43 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:56,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 818 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:56:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 10:56:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 515. [2025-03-08 10:56:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 340 states have (on average 1.4764705882352942) internal successors, (502), 340 states have internal predecessors, (502), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-08 10:56:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 846 transitions. [2025-03-08 10:56:56,303 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 846 transitions. Word has length 538 [2025-03-08 10:56:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:56,305 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 846 transitions. [2025-03-08 10:56:56,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 846 transitions. [2025-03-08 10:56:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-08 10:56:56,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:56,309 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:56,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:56:56,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:56,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 144435145, now seen corresponding path program 1 times [2025-03-08 10:56:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:56,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314325007] [2025-03-08 10:56:56,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:56,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:56,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 10:56:56,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 10:56:56,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:56,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314325007] [2025-03-08 10:56:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314325007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:56,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:56:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476711458] [2025-03-08 10:56:56,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:56,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:56:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:56,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:56:56,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:56:56,568 INFO L87 Difference]: Start difference. First operand 515 states and 846 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:56,689 INFO L93 Difference]: Finished difference Result 1531 states and 2522 transitions. [2025-03-08 10:56:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:56:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 538 [2025-03-08 10:56:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:56,696 INFO L225 Difference]: With dead ends: 1531 [2025-03-08 10:56:56,696 INFO L226 Difference]: Without dead ends: 1019 [2025-03-08 10:56:56,698 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-08 10:56:56,698 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 397 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:56,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1161 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:56:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-08 10:56:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2025-03-08 10:56:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 668 states have (on average 1.473053892215569) internal successors, (984), 668 states have internal predecessors, (984), 344 states have call successors, (344), 4 states have call predecessors, (344), 4 states have return successors, (344), 344 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-08 10:56:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1672 transitions. [2025-03-08 10:56:56,773 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1672 transitions. Word has length 538 [2025-03-08 10:56:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:56,774 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1672 transitions. [2025-03-08 10:56:56,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1672 transitions. [2025-03-08 10:56:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-08 10:56:56,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:56,777 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:56,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:56:56,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash 113829703, now seen corresponding path program 1 times [2025-03-08 10:56:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:56,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572485863] [2025-03-08 10:56:56,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:56,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-08 10:56:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-08 10:56:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572485863] [2025-03-08 10:56:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572485863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:57,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:56:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074183235] [2025-03-08 10:56:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:56:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:57,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:56:57,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:56:57,366 INFO L87 Difference]: Start difference. First operand 1017 states and 1672 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:57,563 INFO L93 Difference]: Finished difference Result 2597 states and 4274 transitions. [2025-03-08 10:56:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:56:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 539 [2025-03-08 10:56:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:57,572 INFO L225 Difference]: With dead ends: 2597 [2025-03-08 10:56:57,572 INFO L226 Difference]: Without dead ends: 1583 [2025-03-08 10:56:57,575 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-08 10:56:57,575 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 221 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:57,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1526 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:56:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-08 10:56:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1573. [2025-03-08 10:56:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1160 states have (on average 1.5379310344827586) internal successors, (1784), 1164 states have internal predecessors, (1784), 404 states have call successors, (404), 8 states have call predecessors, (404), 8 states have return successors, (404), 400 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-08 10:56:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2592 transitions. [2025-03-08 10:56:57,689 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2592 transitions. Word has length 539 [2025-03-08 10:56:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2592 transitions. [2025-03-08 10:56:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:56:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2592 transitions. [2025-03-08 10:56:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-08 10:56:57,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:57,693 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:56:57,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 744288328, now seen corresponding path program 1 times [2025-03-08 10:56:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869548863] [2025-03-08 10:56:57,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:57,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-08 10:56:57,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-08 10:56:57,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:57,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:56:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:58,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869548863] [2025-03-08 10:56:58,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869548863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:58,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:56:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819112578] [2025-03-08 10:56:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:58,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:56:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:58,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:56:58,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:56:58,213 INFO L87 Difference]: Start difference. First operand 1573 states and 2592 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:56:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:59,323 INFO L93 Difference]: Finished difference Result 4731 states and 7803 transitions. [2025-03-08 10:56:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:56:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-03-08 10:56:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:59,345 INFO L225 Difference]: With dead ends: 4731 [2025-03-08 10:56:59,346 INFO L226 Difference]: Without dead ends: 3945 [2025-03-08 10:56:59,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:56:59,350 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 978 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:59,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1798 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:56:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-08 10:56:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3925. [2025-03-08 10:56:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 2894 states have (on average 1.5418106427090532) internal successors, (4462), 2904 states have internal predecessors, (4462), 1010 states have call successors, (1010), 20 states have call predecessors, (1010), 20 states have return successors, (1010), 1000 states have call predecessors, (1010), 1010 states have call successors, (1010) [2025-03-08 10:56:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6482 transitions. [2025-03-08 10:56:59,625 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6482 transitions. Word has length 539 [2025-03-08 10:56:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:59,626 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 6482 transitions. [2025-03-08 10:56:59,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:56:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6482 transitions. [2025-03-08 10:56:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-08 10:56:59,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:59,633 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:56:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:56:59,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -3446616, now seen corresponding path program 1 times [2025-03-08 10:56:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075439427] [2025-03-08 10:56:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-08 10:56:59,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-08 10:56:59,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:59,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:57:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075439427] [2025-03-08 10:57:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075439427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:57:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184844202] [2025-03-08 10:57:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:57:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:00,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:57:00,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:57:00,393 INFO L87 Difference]: Start difference. First operand 3925 states and 6482 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:57:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:02,088 INFO L93 Difference]: Finished difference Result 22794 states and 37520 transitions. [2025-03-08 10:57:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:57:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-03-08 10:57:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:02,184 INFO L225 Difference]: With dead ends: 22794 [2025-03-08 10:57:02,184 INFO L226 Difference]: Without dead ends: 18872 [2025-03-08 10:57:02,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:57:02,204 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2990 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:02,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2990 Valid, 3092 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:57:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18872 states. [2025-03-08 10:57:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18872 to 8255. [2025-03-08 10:57:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8255 states, 6654 states have (on average 1.5755936278929967) internal successors, (10484), 6694 states have internal predecessors, (10484), 1540 states have call successors, (1540), 60 states have call predecessors, (1540), 60 states have return successors, (1540), 1500 states have call predecessors, (1540), 1540 states have call successors, (1540) [2025-03-08 10:57:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 13564 transitions. [2025-03-08 10:57:03,041 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 13564 transitions. Word has length 539 [2025-03-08 10:57:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:03,042 INFO L471 AbstractCegarLoop]: Abstraction has 8255 states and 13564 transitions. [2025-03-08 10:57:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:57:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 13564 transitions. [2025-03-08 10:57:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-08 10:57:03,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:03,046 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:03,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:57:03,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:03,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash -318116213, now seen corresponding path program 1 times [2025-03-08 10:57:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:03,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951066114] [2025-03-08 10:57:03,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:03,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-08 10:57:03,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-08 10:57:03,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:03,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:57:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951066114] [2025-03-08 10:57:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951066114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:57:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831188874] [2025-03-08 10:57:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:57:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:57:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:04,209 INFO L87 Difference]: Start difference. First operand 8255 states and 13564 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:57:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:05,529 INFO L93 Difference]: Finished difference Result 29361 states and 47957 transitions. [2025-03-08 10:57:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:57:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 540 [2025-03-08 10:57:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:05,595 INFO L225 Difference]: With dead ends: 29361 [2025-03-08 10:57:05,595 INFO L226 Difference]: Without dead ends: 21109 [2025-03-08 10:57:05,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:57:05,622 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 482 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:05,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1158 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:57:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21109 states. [2025-03-08 10:57:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21109 to 15345. [2025-03-08 10:57:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15345 states, 12604 states have (on average 1.5752142177086639) internal successors, (19854), 12694 states have internal predecessors, (19854), 2620 states have call successors, (2620), 120 states have call predecessors, (2620), 120 states have return successors, (2620), 2530 states have call predecessors, (2620), 2620 states have call successors, (2620) [2025-03-08 10:57:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15345 states to 15345 states and 25094 transitions. [2025-03-08 10:57:06,634 INFO L78 Accepts]: Start accepts. Automaton has 15345 states and 25094 transitions. Word has length 540 [2025-03-08 10:57:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 15345 states and 25094 transitions. [2025-03-08 10:57:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:57:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 15345 states and 25094 transitions. [2025-03-08 10:57:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-08 10:57:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:06,640 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:06,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:57:06,641 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1632184042, now seen corresponding path program 1 times [2025-03-08 10:57:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545024056] [2025-03-08 10:57:06,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:06,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-08 10:57:06,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-08 10:57:06,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 180 proven. 75 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 10:57:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545024056] [2025-03-08 10:57:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545024056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547142243] [2025-03-08 10:57:07,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:07,036 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-08 10:57:07,037 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-08 10:57:07,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-08 10:57:07,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-08 10:57:07,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:07,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:07,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:57:07,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3489 proven. 33 refuted. 0 times theorem prover too weak. 11098 trivial. 0 not checked. [2025-03-08 10:57:07,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 222 proven. 33 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 10:57:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547142243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:07,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-08 10:57:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586931015] [2025-03-08 10:57:07,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:57:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:07,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:57:07,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:57:07,800 INFO L87 Difference]: Start difference. First operand 15345 states and 25094 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-08 10:57:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:09,663 INFO L93 Difference]: Finished difference Result 31027 states and 50495 transitions. [2025-03-08 10:57:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:57:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) Word has length 540 [2025-03-08 10:57:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:09,717 INFO L225 Difference]: With dead ends: 31027 [2025-03-08 10:57:09,717 INFO L226 Difference]: Without dead ends: 15685 [2025-03-08 10:57:09,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1077 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2025-03-08 10:57:09,750 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1014 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:09,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 737 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:57:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15685 states. [2025-03-08 10:57:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15685 to 15465. [2025-03-08 10:57:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15465 states, 12694 states have (on average 1.54750275720813) internal successors, (19644), 12784 states have internal predecessors, (19644), 2620 states have call successors, (2620), 150 states have call predecessors, (2620), 150 states have return successors, (2620), 2530 states have call predecessors, (2620), 2620 states have call successors, (2620) [2025-03-08 10:57:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15465 states to 15465 states and 24884 transitions. [2025-03-08 10:57:10,683 INFO L78 Accepts]: Start accepts. Automaton has 15465 states and 24884 transitions. Word has length 540 [2025-03-08 10:57:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:10,684 INFO L471 AbstractCegarLoop]: Abstraction has 15465 states and 24884 transitions. [2025-03-08 10:57:10,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-08 10:57:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15465 states and 24884 transitions. [2025-03-08 10:57:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 10:57:10,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:10,691 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:10,699 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-08 10:57:10,895 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,SelfDestructingSolverStorable9 [2025-03-08 10:57:10,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1533962065, now seen corresponding path program 1 times [2025-03-08 10:57:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16659666] [2025-03-08 10:57:10,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 10:57:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 10:57:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 264 proven. 240 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2025-03-08 10:57:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16659666] [2025-03-08 10:57:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16659666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709008085] [2025-03-08 10:57:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:11,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:11,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:11,532 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-08 10:57:11,534 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-08 10:57:11,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 10:57:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 10:57:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:11,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:57:11,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 8580 proven. 240 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2025-03-08 10:57:12,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 264 proven. 243 refuted. 0 times theorem prover too weak. 14113 trivial. 0 not checked. [2025-03-08 10:57:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709008085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:13,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 17 [2025-03-08 10:57:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800421262] [2025-03-08 10:57:13,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 10:57:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:13,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 10:57:13,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:57:13,226 INFO L87 Difference]: Start difference. First operand 15465 states and 24884 transitions. Second operand has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) [2025-03-08 10:57:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:16,366 INFO L93 Difference]: Finished difference Result 49491 states and 78567 transitions. [2025-03-08 10:57:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 10:57:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) Word has length 541 [2025-03-08 10:57:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:16,472 INFO L225 Difference]: With dead ends: 49491 [2025-03-08 10:57:16,472 INFO L226 Difference]: Without dead ends: 33629 [2025-03-08 10:57:16,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1077 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=628, Invalid=1724, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 10:57:16,504 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1684 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:16,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 1572 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:57:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2025-03-08 10:57:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 21435. [2025-03-08 10:57:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21435 states, 17454 states have (on average 1.5282456743439898) internal successors, (26674), 17594 states have internal predecessors, (26674), 3720 states have call successors, (3720), 260 states have call predecessors, (3720), 260 states have return successors, (3720), 3580 states have call predecessors, (3720), 3720 states have call successors, (3720) [2025-03-08 10:57:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21435 states to 21435 states and 34114 transitions. [2025-03-08 10:57:18,781 INFO L78 Accepts]: Start accepts. Automaton has 21435 states and 34114 transitions. Word has length 541 [2025-03-08 10:57:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:18,781 INFO L471 AbstractCegarLoop]: Abstraction has 21435 states and 34114 transitions. [2025-03-08 10:57:18,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) [2025-03-08 10:57:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 21435 states and 34114 transitions. [2025-03-08 10:57:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-08 10:57:18,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:18,789 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:18,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:57:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:18,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -731463983, now seen corresponding path program 1 times [2025-03-08 10:57:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982267128] [2025-03-08 10:57:18,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:19,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 10:57:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 10:57:19,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 66 proven. 189 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 10:57:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:19,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982267128] [2025-03-08 10:57:19,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982267128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:19,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352093499] [2025-03-08 10:57:19,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:19,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:19,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:19,638 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-08 10:57:19,640 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-08 10:57:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-08 10:57:19,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-08 10:57:19,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:19,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 10:57:19,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3908 proven. 660 refuted. 0 times theorem prover too weak. 10052 trivial. 0 not checked. [2025-03-08 10:57:21,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:57:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 87 proven. 669 refuted. 0 times theorem prover too weak. 13864 trivial. 0 not checked. [2025-03-08 10:57:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352093499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:57:24,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:57:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-08 10:57:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438396280] [2025-03-08 10:57:24,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:57:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 10:57:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:24,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 10:57:24,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-08 10:57:24,164 INFO L87 Difference]: Start difference. First operand 21435 states and 34114 transitions. Second operand has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) [2025-03-08 10:57:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:28,551 INFO L93 Difference]: Finished difference Result 50479 states and 78102 transitions. [2025-03-08 10:57:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 10:57:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) Word has length 541 [2025-03-08 10:57:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:28,631 INFO L225 Difference]: With dead ends: 50479 [2025-03-08 10:57:28,631 INFO L226 Difference]: Without dead ends: 29047 [2025-03-08 10:57:28,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=986, Invalid=2554, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 10:57:28,670 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1650 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:28,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1842 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:57:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29047 states. [2025-03-08 10:57:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29047 to 26381. [2025-03-08 10:57:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26381 states, 21910 states have (on average 1.4975810132359653) internal successors, (32812), 22078 states have internal predecessors, (32812), 3816 states have call successors, (3816), 654 states have call predecessors, (3816), 654 states have return successors, (3816), 3648 states have call predecessors, (3816), 3816 states have call successors, (3816) [2025-03-08 10:57:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26381 states to 26381 states and 40444 transitions. [2025-03-08 10:57:31,130 INFO L78 Accepts]: Start accepts. Automaton has 26381 states and 40444 transitions. Word has length 541 [2025-03-08 10:57:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:31,131 INFO L471 AbstractCegarLoop]: Abstraction has 26381 states and 40444 transitions. [2025-03-08 10:57:31,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) [2025-03-08 10:57:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26381 states and 40444 transitions. [2025-03-08 10:57:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 10:57:31,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:31,143 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:31,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 10:57:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:31,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1494326222, now seen corresponding path program 1 times [2025-03-08 10:57:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744867472] [2025-03-08 10:57:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:31,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 10:57:31,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 10:57:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:57:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744867472] [2025-03-08 10:57:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744867472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:31,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:57:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520865849] [2025-03-08 10:57:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:31,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:57:31,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:57:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:57:31,613 INFO L87 Difference]: Start difference. First operand 26381 states and 40444 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:57:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:34,430 INFO L93 Difference]: Finished difference Result 39723 states and 61026 transitions. [2025-03-08 10:57:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:57:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 543 [2025-03-08 10:57:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:34,506 INFO L225 Difference]: With dead ends: 39723 [2025-03-08 10:57:34,507 INFO L226 Difference]: Without dead ends: 26503 [2025-03-08 10:57:34,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:57:34,535 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 226 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:34,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1771 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:57:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26503 states. [2025-03-08 10:57:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26503 to 17629. [2025-03-08 10:57:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17629 states, 14648 states have (on average 1.4961769524849808) internal successors, (21916), 14760 states have internal predecessors, (21916), 2544 states have call successors, (2544), 436 states have call predecessors, (2544), 436 states have return successors, (2544), 2432 states have call predecessors, (2544), 2544 states have call successors, (2544) [2025-03-08 10:57:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17629 states to 17629 states and 27004 transitions. [2025-03-08 10:57:36,448 INFO L78 Accepts]: Start accepts. Automaton has 17629 states and 27004 transitions. Word has length 543 [2025-03-08 10:57:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 17629 states and 27004 transitions. [2025-03-08 10:57:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:57:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17629 states and 27004 transitions. [2025-03-08 10:57:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 10:57:36,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:36,457 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:36,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:57:36,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 315158725, now seen corresponding path program 1 times [2025-03-08 10:57:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330319140] [2025-03-08 10:57:36,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:36,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 10:57:36,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 10:57:36,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:36,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:57:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330319140] [2025-03-08 10:57:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330319140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:36,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:57:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775160512] [2025-03-08 10:57:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:57:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:57:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:57:36,784 INFO L87 Difference]: Start difference. First operand 17629 states and 27004 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:57:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:42,484 INFO L93 Difference]: Finished difference Result 57349 states and 87907 transitions. [2025-03-08 10:57:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:57:42,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 543 [2025-03-08 10:57:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:42,602 INFO L225 Difference]: With dead ends: 57349 [2025-03-08 10:57:42,602 INFO L226 Difference]: Without dead ends: 52941 [2025-03-08 10:57:42,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:57:42,620 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1122 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:42,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1446 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:57:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52941 states. [2025-03-08 10:57:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52941 to 44065. [2025-03-08 10:57:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44065 states, 36614 states have (on average 1.4962582618670455) internal successors, (54784), 36894 states have internal predecessors, (54784), 6360 states have call successors, (6360), 1090 states have call predecessors, (6360), 1090 states have return successors, (6360), 6080 states have call predecessors, (6360), 6360 states have call successors, (6360) [2025-03-08 10:57:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44065 states to 44065 states and 67504 transitions. [2025-03-08 10:57:47,086 INFO L78 Accepts]: Start accepts. Automaton has 44065 states and 67504 transitions. Word has length 543 [2025-03-08 10:57:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:47,086 INFO L471 AbstractCegarLoop]: Abstraction has 44065 states and 67504 transitions. [2025-03-08 10:57:47,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:57:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44065 states and 67504 transitions. [2025-03-08 10:57:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 10:57:47,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:47,097 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:57:47,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:57:47,097 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:47,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash 44605452, now seen corresponding path program 1 times [2025-03-08 10:57:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:47,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664677766] [2025-03-08 10:57:47,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:47,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:47,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 10:57:47,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 10:57:47,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:57:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:47,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664677766] [2025-03-08 10:57:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664677766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:57:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067598636] [2025-03-08 10:57:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:47,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:57:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:47,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:57:47,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:57:47,501 INFO L87 Difference]: Start difference. First operand 44065 states and 67504 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:57:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:53,718 INFO L93 Difference]: Finished difference Result 93175 states and 142327 transitions. [2025-03-08 10:57:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:57:53,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 543 [2025-03-08 10:57:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:53,864 INFO L225 Difference]: With dead ends: 93175 [2025-03-08 10:57:53,864 INFO L226 Difference]: Without dead ends: 71053 [2025-03-08 10:57:53,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:57:53,905 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 595 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:53,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1560 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:57:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71053 states. [2025-03-08 10:58:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71053 to 64989. [2025-03-08 10:58:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64989 states, 54558 states have (on average 1.4981487591187361) internal successors, (81736), 54950 states have internal predecessors, (81736), 8904 states have call successors, (8904), 1526 states have call predecessors, (8904), 1526 states have return successors, (8904), 8512 states have call predecessors, (8904), 8904 states have call successors, (8904) [2025-03-08 10:58:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64989 states to 64989 states and 99544 transitions. [2025-03-08 10:58:00,523 INFO L78 Accepts]: Start accepts. Automaton has 64989 states and 99544 transitions. Word has length 543 [2025-03-08 10:58:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:00,524 INFO L471 AbstractCegarLoop]: Abstraction has 64989 states and 99544 transitions. [2025-03-08 10:58:00,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 10:58:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 64989 states and 99544 transitions. [2025-03-08 10:58:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-08 10:58:00,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:00,536 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:58:00,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:58:00,537 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:00,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash 703134777, now seen corresponding path program 1 times [2025-03-08 10:58:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:00,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979875201] [2025-03-08 10:58:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:00,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-08 10:58:00,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-08 10:58:00,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:00,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 10:58:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979875201] [2025-03-08 10:58:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979875201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 10:58:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537557739] [2025-03-08 10:58:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:00,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:58:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:00,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:58:00,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:58:00,972 INFO L87 Difference]: Start difference. First operand 64989 states and 99544 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 10:58:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:07,370 INFO L93 Difference]: Finished difference Result 130399 states and 199597 transitions. [2025-03-08 10:58:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:58:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 543 [2025-03-08 10:58:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:07,538 INFO L225 Difference]: With dead ends: 130399 [2025-03-08 10:58:07,538 INFO L226 Difference]: Without dead ends: 65413 [2025-03-08 10:58:07,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:58:07,626 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1197 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 865 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 865 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:07,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1765 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [865 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:58:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65413 states.