./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.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 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:05:09,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:05:09,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:05:09,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:05:09,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:05:10,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:05:10,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:05:10,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:05:10,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:05:10,011 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:05:10,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:05:10,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:05:10,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:05:10,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:05:10,012 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:05:10,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:05:10,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:05:10,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:05:10,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:05:10,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:10,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:05:10,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:05:10,014 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 -> 0195a79ad7eda7ad8a0c6adcb8066ff123870f81fcea1f23c209e71678638ac8 [2025-03-03 20:05:10,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:05:10,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:05:10,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:05:10,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:05:10,263 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:05:10,263 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-500_file-12.i [2025-03-03 20:05:11,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30154959/ad66c325382a4705b4184cfe99f0f46d/FLAGc556f94f1 [2025-03-03 20:05:11,606 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:05:11,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-03 20:05:11,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30154959/ad66c325382a4705b4184cfe99f0f46d/FLAGc556f94f1 [2025-03-03 20:05:11,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30154959/ad66c325382a4705b4184cfe99f0f46d [2025-03-03 20:05:11,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:05:11,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:05:11,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:11,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:05:11,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:05:11,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:11" (1/1) ... [2025-03-03 20:05:11,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5038219f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:11, skipping insertion in model container [2025-03-03 20:05:11,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:11" (1/1) ... [2025-03-03 20:05:11,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:05:12,069 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-500_file-12.i[916,929] [2025-03-03 20:05:12,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:12,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:05:12,253 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-500_file-12.i[916,929] [2025-03-03 20:05:12,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:12,347 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:05:12,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12 WrapperNode [2025-03-03 20:05:12,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:12,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:12,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:05:12,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:05:12,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,423 INFO L138 Inliner]: procedures = 26, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 820 [2025-03-03 20:05:12,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:12,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:05:12,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:05:12,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:05:12,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,473 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:05:12,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:05:12,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:05:12,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:05:12,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:05:12,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (1/1) ... [2025-03-03 20:05:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:12,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:12,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:05:12,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:05:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:05:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:05:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:05:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:05:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:05:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:05:12,704 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:05:12,705 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:05:13,692 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:05:13,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:05:13,730 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:05:13,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:05:13,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:13 BoogieIcfgContainer [2025-03-03 20:05:13,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:05:13,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:05:13,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:05:13,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:05:13,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:05:11" (1/3) ... [2025-03-03 20:05:13,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc103c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:13, skipping insertion in model container [2025-03-03 20:05:13,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:12" (2/3) ... [2025-03-03 20:05:13,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc103c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:13, skipping insertion in model container [2025-03-03 20:05:13,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:13" (3/3) ... [2025-03-03 20:05:13,744 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i [2025-03-03 20:05:13,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:05:13,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-12.i that has 2 procedures, 339 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:05:13,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:05:13,833 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;@70e04e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:05:13,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:05:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 20:05:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-03-03 20:05:13,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:13,874 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:13,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:13,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1946880649, now seen corresponding path program 1 times [2025-03-03 20:05:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:13,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453474291] [2025-03-03 20:05:13,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-03-03 20:05:14,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-03-03 20:05:14,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:14,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:14,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453474291] [2025-03-03 20:05:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453474291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:14,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:14,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:05:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534970414] [2025-03-03 20:05:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:14,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:05:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:14,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:05:14,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:05:14,616 INFO L87 Difference]: Start difference. First operand has 339 states, 228 states have (on average 1.5789473684210527) internal successors, (360), 229 states have internal predecessors, (360), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:14,714 INFO L93 Difference]: Finished difference Result 672 states and 1255 transitions. [2025-03-03 20:05:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:05:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 690 [2025-03-03 20:05:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:14,728 INFO L225 Difference]: With dead ends: 672 [2025-03-03 20:05:14,729 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 20:05:14,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:05:14,740 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:14,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 20:05:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-03-03 20:05:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.5663716814159292) internal successors, (354), 226 states have internal predecessors, (354), 108 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 20:05:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 570 transitions. [2025-03-03 20:05:14,835 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 570 transitions. Word has length 690 [2025-03-03 20:05:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 570 transitions. [2025-03-03 20:05:14,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 570 transitions. [2025-03-03 20:05:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-03 20:05:14,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:14,855 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:14,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 20:05:14,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1669884111, now seen corresponding path program 1 times [2025-03-03 20:05:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015586329] [2025-03-03 20:05:14,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:14,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-03 20:05:15,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-03 20:05:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:15,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015586329] [2025-03-03 20:05:15,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015586329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:15,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:15,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945771457] [2025-03-03 20:05:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:15,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:15,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:15,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:15,849 INFO L87 Difference]: Start difference. First operand 336 states and 570 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:15,970 INFO L93 Difference]: Finished difference Result 1001 states and 1702 transitions. [2025-03-03 20:05:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 691 [2025-03-03 20:05:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:15,980 INFO L225 Difference]: With dead ends: 1001 [2025-03-03 20:05:15,982 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 20:05:15,984 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-03 20:05:15,985 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 349 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:15,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1090 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 20:05:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2025-03-03 20:05:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 447 states have (on average 1.5659955257270695) internal successors, (700), 447 states have internal predecessors, (700), 216 states have call successors, (216), 2 states have call predecessors, (216), 2 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-03 20:05:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1132 transitions. [2025-03-03 20:05:16,085 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1132 transitions. Word has length 691 [2025-03-03 20:05:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:16,087 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1132 transitions. [2025-03-03 20:05:16,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1132 transitions. [2025-03-03 20:05:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:16,107 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:05:16,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1775084902, now seen corresponding path program 1 times [2025-03-03 20:05:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678881840] [2025-03-03 20:05:16,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:16,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:16,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:16,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:16,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678881840] [2025-03-03 20:05:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678881840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276708428] [2025-03-03 20:05:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:16,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:16,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:16,487 INFO L87 Difference]: Start difference. First operand 666 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:16,603 INFO L93 Difference]: Finished difference Result 1714 states and 2928 transitions. [2025-03-03 20:05:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:16,615 INFO L225 Difference]: With dead ends: 1714 [2025-03-03 20:05:16,616 INFO L226 Difference]: Without dead ends: 1051 [2025-03-03 20:05:16,620 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-03 20:05:16,621 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 333 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:16,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1274 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-03 20:05:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1047. [2025-03-03 20:05:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 768 states have (on average 1.6197916666666667) internal successors, (1244), 770 states have internal predecessors, (1244), 274 states have call successors, (274), 4 states have call predecessors, (274), 4 states have return successors, (274), 272 states have call predecessors, (274), 274 states have call successors, (274) [2025-03-03 20:05:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1792 transitions. [2025-03-03 20:05:16,758 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1792 transitions. Word has length 692 [2025-03-03 20:05:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:16,761 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1792 transitions. [2025-03-03 20:05:16,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1792 transitions. [2025-03-03 20:05:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:16,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:16,769 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:05:16,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:16,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 941929158, now seen corresponding path program 1 times [2025-03-03 20:05:16,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61298546] [2025-03-03 20:05:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:16,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:16,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:16,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:16,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61298546] [2025-03-03 20:05:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61298546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824004445] [2025-03-03 20:05:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:17,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:17,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:17,041 INFO L87 Difference]: Start difference. First operand 1047 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:17,169 INFO L93 Difference]: Finished difference Result 2857 states and 4904 transitions. [2025-03-03 20:05:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:17,185 INFO L225 Difference]: With dead ends: 2857 [2025-03-03 20:05:17,186 INFO L226 Difference]: Without dead ends: 1813 [2025-03-03 20:05:17,190 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-03 20:05:17,191 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 329 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:17,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1245 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-03-03 20:05:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1809. [2025-03-03 20:05:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1394 states have (on average 1.6384505021520803) internal successors, (2284), 1400 states have internal predecessors, (2284), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-03 20:05:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 3096 transitions. [2025-03-03 20:05:17,321 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 3096 transitions. Word has length 692 [2025-03-03 20:05:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 3096 transitions. [2025-03-03 20:05:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3096 transitions. [2025-03-03 20:05:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:17,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:17,329 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:05:17,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:17,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1202286938, now seen corresponding path program 1 times [2025-03-03 20:05:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014442711] [2025-03-03 20:05:17,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:17,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:17,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:17,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:17,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014442711] [2025-03-03 20:05:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014442711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101384577] [2025-03-03 20:05:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:17,611 INFO L87 Difference]: Start difference. First operand 1809 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:17,767 INFO L93 Difference]: Finished difference Result 5357 states and 9166 transitions. [2025-03-03 20:05:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:17,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:17,787 INFO L225 Difference]: With dead ends: 5357 [2025-03-03 20:05:17,787 INFO L226 Difference]: Without dead ends: 3551 [2025-03-03 20:05:17,792 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-03 20:05:17,792 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 544 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:17,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2025-03-03 20:05:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 1873. [2025-03-03 20:05:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1458 states have (on average 1.635116598079561) internal successors, (2384), 1464 states have internal predecessors, (2384), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-03 20:05:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3196 transitions. [2025-03-03 20:05:17,976 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3196 transitions. Word has length 692 [2025-03-03 20:05:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3196 transitions. [2025-03-03 20:05:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3196 transitions. [2025-03-03 20:05:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:18,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:18,000 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:05:18,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:18,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2095608005, now seen corresponding path program 1 times [2025-03-03 20:05:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:18,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138227023] [2025-03-03 20:05:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:18,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:18,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:18,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:18,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138227023] [2025-03-03 20:05:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138227023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:18,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:18,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821761318] [2025-03-03 20:05:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:18,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:18,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:18,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:18,470 INFO L87 Difference]: Start difference. First operand 1873 states and 3196 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:18,713 INFO L93 Difference]: Finished difference Result 4813 states and 8158 transitions. [2025-03-03 20:05:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:18,731 INFO L225 Difference]: With dead ends: 4813 [2025-03-03 20:05:18,731 INFO L226 Difference]: Without dead ends: 2943 [2025-03-03 20:05:18,736 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-03 20:05:18,736 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 190 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:18,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1108 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-03-03 20:05:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2937. [2025-03-03 20:05:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2258 states have (on average 1.6067316209034543) internal successors, (3628), 2272 states have internal predecessors, (3628), 662 states have call successors, (662), 16 states have call predecessors, (662), 16 states have return successors, (662), 648 states have call predecessors, (662), 662 states have call successors, (662) [2025-03-03 20:05:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4952 transitions. [2025-03-03 20:05:19,002 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4952 transitions. Word has length 692 [2025-03-03 20:05:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 4952 transitions. [2025-03-03 20:05:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4952 transitions. [2025-03-03 20:05:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:19,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:19,012 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:05:19,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1317449114, now seen corresponding path program 1 times [2025-03-03 20:05:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589165725] [2025-03-03 20:05:19,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:19,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:19,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589165725] [2025-03-03 20:05:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589165725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:05:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318742506] [2025-03-03 20:05:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:19,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:05:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:19,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:05:19,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:19,652 INFO L87 Difference]: Start difference. First operand 2937 states and 4952 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:20,421 INFO L93 Difference]: Finished difference Result 11687 states and 19771 transitions. [2025-03-03 20:05:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:05:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:20,471 INFO L225 Difference]: With dead ends: 11687 [2025-03-03 20:05:20,471 INFO L226 Difference]: Without dead ends: 8753 [2025-03-03 20:05:20,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:05:20,484 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 894 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:20,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2443 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:05:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2025-03-03 20:05:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7045. [2025-03-03 20:05:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 5116 states have (on average 1.5516028146989835) internal successors, (7938), 5162 states have internal predecessors, (7938), 1878 states have call successors, (1878), 50 states have call predecessors, (1878), 50 states have return successors, (1878), 1832 states have call predecessors, (1878), 1878 states have call successors, (1878) [2025-03-03 20:05:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 11694 transitions. [2025-03-03 20:05:21,161 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 11694 transitions. Word has length 692 [2025-03-03 20:05:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 11694 transitions. [2025-03-03 20:05:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 11694 transitions. [2025-03-03 20:05:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:21,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:21,174 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:21,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:05:21,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -351396568, now seen corresponding path program 1 times [2025-03-03 20:05:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8044960] [2025-03-03 20:05:21,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:21,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:21,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8044960] [2025-03-03 20:05:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8044960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133322402] [2025-03-03 20:05:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:21,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:21,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:21,930 INFO L87 Difference]: Start difference. First operand 7045 states and 11694 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:23,028 INFO L93 Difference]: Finished difference Result 20711 states and 34356 transitions. [2025-03-03 20:05:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:23,110 INFO L225 Difference]: With dead ends: 20711 [2025-03-03 20:05:23,110 INFO L226 Difference]: Without dead ends: 13669 [2025-03-03 20:05:23,137 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-03 20:05:23,138 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 375 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:23,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1252 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13669 states. [2025-03-03 20:05:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13669 to 13663. [2025-03-03 20:05:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13663 states, 9942 states have (on average 1.5477771072218869) internal successors, (15388), 10036 states have internal predecessors, (15388), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-03-03 20:05:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 22628 transitions. [2025-03-03 20:05:24,058 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 22628 transitions. Word has length 692 [2025-03-03 20:05:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:24,059 INFO L471 AbstractCegarLoop]: Abstraction has 13663 states and 22628 transitions. [2025-03-03 20:05:24,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 22628 transitions. [2025-03-03 20:05:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:24,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:24,077 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:24,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:05:24,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:24,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -800093207, now seen corresponding path program 1 times [2025-03-03 20:05:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542732626] [2025-03-03 20:05:24,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:24,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:24,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:24,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:24,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542732626] [2025-03-03 20:05:24,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542732626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:24,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:05:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492571506] [2025-03-03 20:05:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:05:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:24,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:05:24,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:24,927 INFO L87 Difference]: Start difference. First operand 13663 states and 22628 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:26,365 INFO L93 Difference]: Finished difference Result 27345 states and 45290 transitions. [2025-03-03 20:05:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:05:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:26,446 INFO L225 Difference]: With dead ends: 27345 [2025-03-03 20:05:26,446 INFO L226 Difference]: Without dead ends: 13685 [2025-03-03 20:05:26,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:26,500 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 396 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:26,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1818 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:05:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2025-03-03 20:05:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 13679. [2025-03-03 20:05:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13679 states, 9958 states have (on average 1.5468969672625026) internal successors, (15404), 10052 states have internal predecessors, (15404), 3620 states have call successors, (3620), 100 states have call predecessors, (3620), 100 states have return successors, (3620), 3526 states have call predecessors, (3620), 3620 states have call successors, (3620) [2025-03-03 20:05:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 22644 transitions. [2025-03-03 20:05:27,464 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 22644 transitions. Word has length 692 [2025-03-03 20:05:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 13679 states and 22644 transitions. [2025-03-03 20:05:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 22644 transitions. [2025-03-03 20:05:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-03-03 20:05:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:27,483 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:05:27,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1008791510, now seen corresponding path program 1 times [2025-03-03 20:05:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720726862] [2025-03-03 20:05:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:27,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-03-03 20:05:27,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-03-03 20:05:27,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:27,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720726862] [2025-03-03 20:05:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720726862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:28,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:05:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041507841] [2025-03-03 20:05:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:28,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:05:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:28,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:05:28,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:05:28,425 INFO L87 Difference]: Start difference. First operand 13679 states and 22644 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:31,184 INFO L93 Difference]: Finished difference Result 40473 states and 66892 transitions. [2025-03-03 20:05:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:05:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 692 [2025-03-03 20:05:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:31,314 INFO L225 Difference]: With dead ends: 40473 [2025-03-03 20:05:31,315 INFO L226 Difference]: Without dead ends: 26789 [2025-03-03 20:05:31,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:05:31,361 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1409 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:31,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3027 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:05:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2025-03-03 20:05:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 20433. [2025-03-03 20:05:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20433 states, 14944 states have (on average 1.5467077087794432) internal successors, (23114), 15086 states have internal predecessors, (23114), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-03-03 20:05:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20433 states to 20433 states and 33790 transitions. [2025-03-03 20:05:32,996 INFO L78 Accepts]: Start accepts. Automaton has 20433 states and 33790 transitions. Word has length 692 [2025-03-03 20:05:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:32,998 INFO L471 AbstractCegarLoop]: Abstraction has 20433 states and 33790 transitions. [2025-03-03 20:05:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20433 states and 33790 transitions. [2025-03-03 20:05:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 20:05:33,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:33,021 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:33,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:05:33,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:33,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash -248152429, now seen corresponding path program 1 times [2025-03-03 20:05:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855502769] [2025-03-03 20:05:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:33,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 20:05:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 20:05:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855502769] [2025-03-03 20:05:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855502769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:05:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817774683] [2025-03-03 20:05:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:33,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:05:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:33,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:05:33,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:33,315 INFO L87 Difference]: Start difference. First operand 20433 states and 33790 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:34,752 INFO L93 Difference]: Finished difference Result 51312 states and 84913 transitions. [2025-03-03 20:05:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:05:34,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-03 20:05:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:34,873 INFO L225 Difference]: With dead ends: 51312 [2025-03-03 20:05:34,874 INFO L226 Difference]: Without dead ends: 30874 [2025-03-03 20:05:34,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:05:34,936 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 555 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:34,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2205 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:05:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30874 states. [2025-03-03 20:05:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30874 to 21921. [2025-03-03 20:05:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21921 states, 16432 states have (on average 1.568524829600779) internal successors, (25774), 16574 states have internal predecessors, (25774), 5338 states have call successors, (5338), 150 states have call predecessors, (5338), 150 states have return successors, (5338), 5196 states have call predecessors, (5338), 5338 states have call successors, (5338) [2025-03-03 20:05:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 36450 transitions. [2025-03-03 20:05:36,738 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 36450 transitions. Word has length 693 [2025-03-03 20:05:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:36,739 INFO L471 AbstractCegarLoop]: Abstraction has 21921 states and 36450 transitions. [2025-03-03 20:05:36,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 36450 transitions. [2025-03-03 20:05:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 20:05:36,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:36,766 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:36,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:05:36,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash -905547371, now seen corresponding path program 1 times [2025-03-03 20:05:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205895477] [2025-03-03 20:05:36,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 20:05:36,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 20:05:36,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:36,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:37,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205895477] [2025-03-03 20:05:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205895477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:37,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:37,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448029858] [2025-03-03 20:05:37,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:37,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:37,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:37,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:37,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:37,184 INFO L87 Difference]: Start difference. First operand 21921 states and 36450 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:39,512 INFO L93 Difference]: Finished difference Result 64269 states and 106684 transitions. [2025-03-03 20:05:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-03 20:05:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:39,664 INFO L225 Difference]: With dead ends: 64269 [2025-03-03 20:05:39,664 INFO L226 Difference]: Without dead ends: 42351 [2025-03-03 20:05:39,723 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-03 20:05:39,724 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 380 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:39,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1109 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42351 states. [2025-03-03 20:05:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42351 to 42349. [2025-03-03 20:05:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42349 states, 31372 states have (on average 1.5578222618895832) internal successors, (48872), 31656 states have internal predecessors, (48872), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-03-03 20:05:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42349 states to 42349 states and 70224 transitions. [2025-03-03 20:05:42,346 INFO L78 Accepts]: Start accepts. Automaton has 42349 states and 70224 transitions. Word has length 693 [2025-03-03 20:05:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:42,347 INFO L471 AbstractCegarLoop]: Abstraction has 42349 states and 70224 transitions. [2025-03-03 20:05:42,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 42349 states and 70224 transitions. [2025-03-03 20:05:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 20:05:42,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:42,378 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:42,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:05:42,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:42,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1203673708, now seen corresponding path program 1 times [2025-03-03 20:05:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:42,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180506632] [2025-03-03 20:05:42,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:42,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:42,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 20:05:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 20:05:42,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:42,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180506632] [2025-03-03 20:05:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180506632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208985436] [2025-03-03 20:05:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:42,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:42,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:42,776 INFO L87 Difference]: Start difference. First operand 42349 states and 70224 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:46,448 INFO L93 Difference]: Finished difference Result 103553 states and 171698 transitions. [2025-03-03 20:05:46,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:46,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-03 20:05:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:46,719 INFO L225 Difference]: With dead ends: 103553 [2025-03-03 20:05:46,719 INFO L226 Difference]: Without dead ends: 61207 [2025-03-03 20:05:46,861 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-03 20:05:46,862 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 204 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:46,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1104 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61207 states. [2025-03-03 20:05:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61207 to 43549. [2025-03-03 20:05:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43549 states, 32572 states have (on average 1.5722706619182119) internal successors, (51212), 32856 states have internal predecessors, (51212), 10676 states have call successors, (10676), 300 states have call predecessors, (10676), 300 states have return successors, (10676), 10392 states have call predecessors, (10676), 10676 states have call successors, (10676) [2025-03-03 20:05:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43549 states to 43549 states and 72564 transitions. [2025-03-03 20:05:50,072 INFO L78 Accepts]: Start accepts. Automaton has 43549 states and 72564 transitions. Word has length 693 [2025-03-03 20:05:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:50,073 INFO L471 AbstractCegarLoop]: Abstraction has 43549 states and 72564 transitions. [2025-03-03 20:05:50,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 43549 states and 72564 transitions. [2025-03-03 20:05:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-03 20:05:50,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:50,103 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:05:50,104 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:50,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1102761741, now seen corresponding path program 1 times [2025-03-03 20:05:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148467924] [2025-03-03 20:05:50,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:50,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-03 20:05:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-03 20:05:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:50,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23112 trivial. 0 not checked. [2025-03-03 20:05:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148467924] [2025-03-03 20:05:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148467924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:05:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338866423] [2025-03-03 20:05:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:05:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:05:51,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:05:51,040 INFO L87 Difference]: Start difference. First operand 43549 states and 72564 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:54,048 INFO L93 Difference]: Finished difference Result 112903 states and 189493 transitions. [2025-03-03 20:05:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:05:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) Word has length 693 [2025-03-03 20:05:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:54,465 INFO L225 Difference]: With dead ends: 112903 [2025-03-03 20:05:54,469 INFO L226 Difference]: Without dead ends: 69357 [2025-03-03 20:05:54,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:05:54,586 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 541 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:54,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1977 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:05:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69357 states. [2025-03-03 20:05:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69357 to 65035. [2025-03-03 20:05:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65035 states, 53944 states have (on average 1.6343430223935933) internal successors, (88163), 54228 states have internal predecessors, (88163), 10784 states have call successors, (10784), 306 states have call predecessors, (10784), 306 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-03 20:05:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65035 states to 65035 states and 109731 transitions. [2025-03-03 20:05:58,632 INFO L78 Accepts]: Start accepts. Automaton has 65035 states and 109731 transitions. Word has length 693 [2025-03-03 20:05:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 65035 states and 109731 transitions. [2025-03-03 20:05:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 1 states have call predecessors, (108), 1 states have call successors, (108) [2025-03-03 20:05:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 65035 states and 109731 transitions. [2025-03-03 20:05:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-03 20:05:58,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:58,672 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:05:58,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash -597657129, now seen corresponding path program 1 times [2025-03-03 20:05:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995804123] [2025-03-03 20:05:58,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:58,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:05:59,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:05:59,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:05:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995804123] [2025-03-03 20:05:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995804123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:05:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248924077] [2025-03-03 20:05:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:05:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:59,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:05:59,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:05:59,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:05:59,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:05:59,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:59,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:05:59,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-03-03 20:06:00,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:06:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:06:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248924077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:06:00,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:06:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 20:06:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379096412] [2025-03-03 20:06:00,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:06:00,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:06:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:00,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:06:00,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:06:00,850 INFO L87 Difference]: Start difference. First operand 65035 states and 109731 transitions. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-03-03 20:06:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:04,739 INFO L93 Difference]: Finished difference Result 115727 states and 193516 transitions. [2025-03-03 20:06:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:06:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) Word has length 694 [2025-03-03 20:06:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:04,932 INFO L225 Difference]: With dead ends: 115727 [2025-03-03 20:06:04,932 INFO L226 Difference]: Without dead ends: 65941 [2025-03-03 20:06:05,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1384 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-03-03 20:06:05,033 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 920 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:05,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2022 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65941 states. [2025-03-03 20:06:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65941 to 62755. [2025-03-03 20:06:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62755 states, 51590 states have (on average 1.6176972281449893) internal successors, (83457), 51874 states have internal predecessors, (83457), 10784 states have call successors, (10784), 380 states have call predecessors, (10784), 380 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-03 20:06:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62755 states to 62755 states and 105025 transitions. [2025-03-03 20:06:08,830 INFO L78 Accepts]: Start accepts. Automaton has 62755 states and 105025 transitions. Word has length 694 [2025-03-03 20:06:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:08,831 INFO L471 AbstractCegarLoop]: Abstraction has 62755 states and 105025 transitions. [2025-03-03 20:06:08,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 4 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236) [2025-03-03 20:06:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 62755 states and 105025 transitions. [2025-03-03 20:06:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-03 20:06:08,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:08,861 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:08,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:06:09,065 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,SelfDestructingSolverStorable14 [2025-03-03 20:06:09,065 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1622351050, now seen corresponding path program 1 times [2025-03-03 20:06:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659317161] [2025-03-03 20:06:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:09,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:06:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:06:09,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:09,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 129 proven. 192 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:06:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659317161] [2025-03-03 20:06:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659317161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364190429] [2025-03-03 20:06:09,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:09,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:06:09,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:06:09,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:06:10,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:06:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:10,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:06:10,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11357 proven. 186 refuted. 0 times theorem prover too weak. 11569 trivial. 0 not checked. [2025-03-03 20:06:10,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:06:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 135 proven. 186 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:06:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364190429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:06:10,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:06:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-03 20:06:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249265993] [2025-03-03 20:06:10,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:06:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:06:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:06:10,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:06:10,884 INFO L87 Difference]: Start difference. First operand 62755 states and 105025 transitions. Second operand has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) [2025-03-03 20:06:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:14,535 INFO L93 Difference]: Finished difference Result 114679 states and 191028 transitions. [2025-03-03 20:06:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 20:06:14,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) Word has length 694 [2025-03-03 20:06:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:14,758 INFO L225 Difference]: With dead ends: 114679 [2025-03-03 20:06:14,759 INFO L226 Difference]: Without dead ends: 63429 [2025-03-03 20:06:14,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1414 GetRequests, 1382 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:06:14,869 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1241 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:14,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2326 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63429 states. [2025-03-03 20:06:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63429 to 61939. [2025-03-03 20:06:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61939 states, 50774 states have (on average 1.6143892543427738) internal successors, (81969), 51058 states have internal predecessors, (81969), 10784 states have call successors, (10784), 380 states have call predecessors, (10784), 380 states have return successors, (10784), 10500 states have call predecessors, (10784), 10784 states have call successors, (10784) [2025-03-03 20:06:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61939 states to 61939 states and 103537 transitions. [2025-03-03 20:06:19,604 INFO L78 Accepts]: Start accepts. Automaton has 61939 states and 103537 transitions. Word has length 694 [2025-03-03 20:06:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 61939 states and 103537 transitions. [2025-03-03 20:06:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.083333333333332) internal successors, (229), 12 states have internal predecessors, (229), 3 states have call successors, (234), 2 states have call predecessors, (234), 4 states have return successors, (236), 3 states have call predecessors, (236), 3 states have call successors, (236) [2025-03-03 20:06:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 61939 states and 103537 transitions. [2025-03-03 20:06:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-03-03 20:06:19,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:19,638 INFO L218 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:19,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:06:19,839 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,SelfDestructingSolverStorable15 [2025-03-03 20:06:19,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:19,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 497936149, now seen corresponding path program 1 times [2025-03-03 20:06:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083619707] [2025-03-03 20:06:19,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:19,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:06:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:06:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:20,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 153 proven. 168 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:06:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083619707] [2025-03-03 20:06:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083619707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537117182] [2025-03-03 20:06:20,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:20,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:20,530 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-03 20:06:20,532 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-03 20:06:20,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-03-03 20:06:20,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-03-03 20:06:20,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:20,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:20,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:06:20,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 10851 proven. 117 refuted. 0 times theorem prover too weak. 12144 trivial. 0 not checked. [2025-03-03 20:06:21,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:06:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 204 proven. 117 refuted. 0 times theorem prover too weak. 22791 trivial. 0 not checked. [2025-03-03 20:06:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537117182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:06:21,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:06:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2025-03-03 20:06:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619309198] [2025-03-03 20:06:21,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:06:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:06:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:21,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:06:21,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:06:21,446 INFO L87 Difference]: Start difference. First operand 61939 states and 103537 transitions. Second operand has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 3 states have call successors, (203), 2 states have call predecessors, (203), 4 states have return successors, (205), 3 states have call predecessors, (205), 3 states have call successors, (205)