./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.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_fillercodestructure_filler-pr-cn_file-81.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 c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:20:11,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:20:11,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:20:11,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:20:11,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:20:11,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:20:11,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:20:11,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:20:11,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:20:11,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:20:11,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:20:11,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:20:11,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:20:11,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:20:11,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:20:11,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:20:11,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:20:11,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:20:11,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:20:11,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:20:11,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:20:11,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:20:11,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:20:11,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:20:11,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:20:11,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:20:11,455 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 -> c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa [2025-03-03 21:20:11,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:20:11,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:20:11,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:20:11,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:20:11,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:20:11,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-03 21:20:12,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9176fc0ee/7fbbcf7ddbb74c0193f07b477fc4b65b/FLAG5695eefe5 [2025-03-03 21:20:13,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:20:13,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-03 21:20:13,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9176fc0ee/7fbbcf7ddbb74c0193f07b477fc4b65b/FLAG5695eefe5 [2025-03-03 21:20:13,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9176fc0ee/7fbbcf7ddbb74c0193f07b477fc4b65b [2025-03-03 21:20:13,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:20:13,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:20:13,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:20:13,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:20:13,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:20:13,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13, skipping insertion in model container [2025-03-03 21:20:13,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:20:13,486 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_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-03-03 21:20:13,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:20:13,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:20:13,559 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_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-03-03 21:20:13,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:20:13,606 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:20:13,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13 WrapperNode [2025-03-03 21:20:13,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:20:13,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:20:13,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:20:13,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:20:13,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,652 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-03 21:20:13,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:20:13,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:20:13,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:20:13,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:20:13,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,685 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 21:20:13,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:20:13,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:20:13,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:20:13,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:20:13,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (1/1) ... [2025-03-03 21:20:13,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:20:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:20:13,744 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 21:20:13,748 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 21:20:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:20:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:20:13,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:20:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:20:13,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:20:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:20:13,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:20:13,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:20:14,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-03 21:20:14,289 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:20:14,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:20:14,310 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:20:14,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:20:14,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:20:14 BoogieIcfgContainer [2025-03-03 21:20:14,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:20:14,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:20:14,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:20:14,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:20:14,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:20:13" (1/3) ... [2025-03-03 21:20:14,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32085e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:20:14, skipping insertion in model container [2025-03-03 21:20:14,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:20:13" (2/3) ... [2025-03-03 21:20:14,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32085e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:20:14, skipping insertion in model container [2025-03-03 21:20:14,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:20:14" (3/3) ... [2025-03-03 21:20:14,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-03 21:20:14,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:20:14,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:20:14,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:20:14,395 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;@3de482fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:20:14,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:20:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 21:20:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 21:20:14,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:14,415 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:14,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:14,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 32893380, now seen corresponding path program 1 times [2025-03-03 21:20:14,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-03 21:20:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:14,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 21:20:14,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 21:20:14,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:14,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-03 21:20:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726882946] [2025-03-03 21:20:14,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726882946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:20:14,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372052660] [2025-03-03 21:20:14,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:14,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:20:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:20:14,810 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 21:20:14,812 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 21:20:14,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 21:20:15,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 21:20:15,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:15,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:15,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:20:15,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:20:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-03 21:20:15,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:20:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372052660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:20:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:20:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984922518] [2025-03-03 21:20:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:15,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:20:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:15,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:20:15,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:20:15,076 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:20:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:15,117 INFO L93 Difference]: Finished difference Result 260 states and 471 transitions. [2025-03-03 21:20:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:20:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2025-03-03 21:20:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:15,123 INFO L225 Difference]: With dead ends: 260 [2025-03-03 21:20:15,123 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 21:20:15,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 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 21:20:15,127 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:15,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:20:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 21:20:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-03 21:20:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 21:20:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2025-03-03 21:20:15,160 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2025-03-03 21:20:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:15,161 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2025-03-03 21:20:15,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:20:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2025-03-03 21:20:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 21:20:15,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:15,165 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:15,172 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 21:20:15,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:20:15,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:15,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 465542560, now seen corresponding path program 1 times [2025-03-03 21:20:15,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:15,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-03-03 21:20:15,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:15,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 21:20:15,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 21:20:15,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:15,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:16,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:16,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-03-03 21:20:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059278007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:20:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647085555] [2025-03-03 21:20:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:20:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:16,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:20:16,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:20:16,024 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:16,282 INFO L93 Difference]: Finished difference Result 385 states and 620 transitions. [2025-03-03 21:20:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:20:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-03-03 21:20:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:16,288 INFO L225 Difference]: With dead ends: 385 [2025-03-03 21:20:16,288 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 21:20:16,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:20:16,291 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 114 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:16,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 522 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:20:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 21:20:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-03 21:20:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:20:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2025-03-03 21:20:16,355 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2025-03-03 21:20:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:16,356 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2025-03-03 21:20:16,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2025-03-03 21:20:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:16,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:16,362 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:16,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:20:16,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1160499125, now seen corresponding path program 1 times [2025-03-03 21:20:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:16,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131695730] [2025-03-03 21:20:16,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:16,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:17,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:17,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131695730] [2025-03-03 21:20:17,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131695730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:17,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:17,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:20:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615972566] [2025-03-03 21:20:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:17,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:20:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:17,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:20:17,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:20:17,661 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:19,036 INFO L93 Difference]: Finished difference Result 1904 states and 3045 transitions. [2025-03-03 21:20:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:20:19,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:20:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:19,048 INFO L225 Difference]: With dead ends: 1904 [2025-03-03 21:20:19,048 INFO L226 Difference]: Without dead ends: 1651 [2025-03-03 21:20:19,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:20:19,051 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 709 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:19,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2024 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:20:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2025-03-03 21:20:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1369. [2025-03-03 21:20:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 848 states have (on average 1.4127358490566038) internal successors, (1198), 852 states have internal predecessors, (1198), 504 states have call successors, (504), 16 states have call predecessors, (504), 16 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-03 21:20:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2206 transitions. [2025-03-03 21:20:19,274 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2206 transitions. Word has length 307 [2025-03-03 21:20:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:19,275 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2206 transitions. [2025-03-03 21:20:19,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2206 transitions. [2025-03-03 21:20:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:19,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:19,279 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:20:19,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1560767634, now seen corresponding path program 1 times [2025-03-03 21:20:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138996336] [2025-03-03 21:20:19,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:19,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:19,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:19,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138996336] [2025-03-03 21:20:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138996336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:20:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254701803] [2025-03-03 21:20:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:20:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:28,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:20:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:20:28,315 INFO L87 Difference]: Start difference. First operand 1369 states and 2206 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:31,562 INFO L93 Difference]: Finished difference Result 4540 states and 7258 transitions. [2025-03-03 21:20:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:20:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:20:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:31,583 INFO L225 Difference]: With dead ends: 4540 [2025-03-03 21:20:31,583 INFO L226 Difference]: Without dead ends: 3174 [2025-03-03 21:20:31,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:20:31,596 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1269 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:31,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1195 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 21:20:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-03-03 21:20:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 1662. [2025-03-03 21:20:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1089 states have (on average 1.43801652892562) internal successors, (1566), 1093 states have internal predecessors, (1566), 554 states have call successors, (554), 18 states have call predecessors, (554), 18 states have return successors, (554), 550 states have call predecessors, (554), 554 states have call successors, (554) [2025-03-03 21:20:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2674 transitions. [2025-03-03 21:20:31,789 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2674 transitions. Word has length 307 [2025-03-03 21:20:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:31,789 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2674 transitions. [2025-03-03 21:20:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2674 transitions. [2025-03-03 21:20:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:31,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:31,793 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:20:31,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1226647853, now seen corresponding path program 1 times [2025-03-03 21:20:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379265847] [2025-03-03 21:20:31,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:31,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:31,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:31,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379265847] [2025-03-03 21:20:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379265847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:32,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:20:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928103343] [2025-03-03 21:20:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:32,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:20:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:32,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:20:32,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:20:32,017 INFO L87 Difference]: Start difference. First operand 1662 states and 2674 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:32,192 INFO L93 Difference]: Finished difference Result 3666 states and 5884 transitions. [2025-03-03 21:20:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:20:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:20:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:32,210 INFO L225 Difference]: With dead ends: 3666 [2025-03-03 21:20:32,210 INFO L226 Difference]: Without dead ends: 2300 [2025-03-03 21:20:32,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:20:32,216 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 72 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:32,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 603 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:20:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2025-03-03 21:20:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2286. [2025-03-03 21:20:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1653 states have (on average 1.4688445251058682) internal successors, (2428), 1669 states have internal predecessors, (2428), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:20:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3632 transitions. [2025-03-03 21:20:32,374 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3632 transitions. Word has length 307 [2025-03-03 21:20:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3632 transitions. [2025-03-03 21:20:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3632 transitions. [2025-03-03 21:20:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:32,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:32,379 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:32,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:20:32,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:32,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash 563695281, now seen corresponding path program 1 times [2025-03-03 21:20:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:32,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357988201] [2025-03-03 21:20:32,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:32,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:32,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:32,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:32,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357988201] [2025-03-03 21:20:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357988201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:20:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524975968] [2025-03-03 21:20:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:20:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:39,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:20:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:20:39,876 INFO L87 Difference]: Start difference. First operand 2286 states and 3632 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:20:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:42,537 INFO L93 Difference]: Finished difference Result 5694 states and 8976 transitions. [2025-03-03 21:20:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:20:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-03-03 21:20:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:42,566 INFO L225 Difference]: With dead ends: 5694 [2025-03-03 21:20:42,566 INFO L226 Difference]: Without dead ends: 3704 [2025-03-03 21:20:42,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:20:42,577 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 796 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:42,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1273 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 21:20:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2025-03-03 21:20:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 2286. [2025-03-03 21:20:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 1653 states have (on average 1.4688445251058682) internal successors, (2428), 1669 states have internal predecessors, (2428), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:20:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3632 transitions. [2025-03-03 21:20:42,803 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3632 transitions. Word has length 307 [2025-03-03 21:20:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:42,804 INFO L471 AbstractCegarLoop]: Abstraction has 2286 states and 3632 transitions. [2025-03-03 21:20:42,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:20:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3632 transitions. [2025-03-03 21:20:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:42,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:42,808 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:42,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:20:42,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash 716295763, now seen corresponding path program 1 times [2025-03-03 21:20:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188086451] [2025-03-03 21:20:42,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:42,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:42,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:42,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:43,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188086451] [2025-03-03 21:20:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188086451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:43,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:20:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086854232] [2025-03-03 21:20:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:43,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:20:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:43,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:20:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:20:43,582 INFO L87 Difference]: Start difference. First operand 2286 states and 3632 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:44,464 INFO L93 Difference]: Finished difference Result 5977 states and 9450 transitions. [2025-03-03 21:20:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:20:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:20:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:44,488 INFO L225 Difference]: With dead ends: 5977 [2025-03-03 21:20:44,488 INFO L226 Difference]: Without dead ends: 3987 [2025-03-03 21:20:44,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:20:44,497 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 614 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:44,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 888 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:20:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2025-03-03 21:20:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 2300. [2025-03-03 21:20:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1667 states have (on average 1.4691061787642472) internal successors, (2449), 1683 states have internal predecessors, (2449), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:20:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3653 transitions. [2025-03-03 21:20:44,731 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3653 transitions. Word has length 307 [2025-03-03 21:20:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 3653 transitions. [2025-03-03 21:20:44,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3653 transitions. [2025-03-03 21:20:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:44,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:44,737 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:20:44,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:44,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -477288655, now seen corresponding path program 1 times [2025-03-03 21:20:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-03-03 21:20:44,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:44,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:44,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:44,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:44,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:20:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:20:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:20:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-03-03 21:20:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399735254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:20:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:20:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:20:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664825111] [2025-03-03 21:20:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:20:53,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:20:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:20:53,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:20:53,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:20:53,363 INFO L87 Difference]: Start difference. First operand 2300 states and 3653 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:20:55,222 INFO L93 Difference]: Finished difference Result 5890 states and 9278 transitions. [2025-03-03 21:20:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:20:55,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:20:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:20:55,243 INFO L225 Difference]: With dead ends: 5890 [2025-03-03 21:20:55,243 INFO L226 Difference]: Without dead ends: 3900 [2025-03-03 21:20:55,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:20:55,251 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 910 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:20:55,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 960 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:20:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2025-03-03 21:20:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 2308. [2025-03-03 21:20:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 1675 states have (on average 1.4704477611940299) internal successors, (2463), 1691 states have internal predecessors, (2463), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:20:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3667 transitions. [2025-03-03 21:20:55,441 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3667 transitions. Word has length 307 [2025-03-03 21:20:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:20:55,441 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 3667 transitions. [2025-03-03 21:20:55,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:20:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3667 transitions. [2025-03-03 21:20:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:20:55,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:20:55,446 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:20:55,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:20:55,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:20:55,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:20:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1474361008, now seen corresponding path program 1 times [2025-03-03 21:20:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:20:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425299274] [2025-03-03 21:20:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:20:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:20:55,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:20:55,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:20:55,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:20:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:01,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425299274] [2025-03-03 21:21:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425299274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:01,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:01,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:21:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534878965] [2025-03-03 21:21:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:01,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:21:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:01,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:21:01,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:21:01,635 INFO L87 Difference]: Start difference. First operand 2308 states and 3667 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:03,280 INFO L93 Difference]: Finished difference Result 5070 states and 8034 transitions. [2025-03-03 21:21:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:21:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:21:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:03,297 INFO L225 Difference]: With dead ends: 5070 [2025-03-03 21:21:03,297 INFO L226 Difference]: Without dead ends: 3080 [2025-03-03 21:21:03,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:21:03,304 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 336 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:03,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 792 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:21:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-03-03 21:21:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2416. [2025-03-03 21:21:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1783 states have (on average 1.4845765563656759) internal successors, (2647), 1799 states have internal predecessors, (2647), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3851 transitions. [2025-03-03 21:21:03,476 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3851 transitions. Word has length 307 [2025-03-03 21:21:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:03,477 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3851 transitions. [2025-03-03 21:21:03,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3851 transitions. [2025-03-03 21:21:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 21:21:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:03,480 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:21:03,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1321760526, now seen corresponding path program 1 times [2025-03-03 21:21:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252173041] [2025-03-03 21:21:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:03,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 21:21:03,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 21:21:03,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:03,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:03,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252173041] [2025-03-03 21:21:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252173041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:21:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110113489] [2025-03-03 21:21:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:21:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:03,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:21:03,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:21:03,930 INFO L87 Difference]: Start difference. First operand 2416 states and 3851 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:04,467 INFO L93 Difference]: Finished difference Result 5466 states and 8689 transitions. [2025-03-03 21:21:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:21:04,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-03 21:21:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:04,486 INFO L225 Difference]: With dead ends: 5466 [2025-03-03 21:21:04,489 INFO L226 Difference]: Without dead ends: 3168 [2025-03-03 21:21:04,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:21:04,495 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 259 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:04,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 762 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:21:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2025-03-03 21:21:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 2416. [2025-03-03 21:21:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 1783 states have (on average 1.4845765563656759) internal successors, (2647), 1799 states have internal predecessors, (2647), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3851 transitions. [2025-03-03 21:21:04,666 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3851 transitions. Word has length 307 [2025-03-03 21:21:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:04,667 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3851 transitions. [2025-03-03 21:21:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3851 transitions. [2025-03-03 21:21:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 21:21:04,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:04,670 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:04,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:21:04,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1167060494, now seen corresponding path program 1 times [2025-03-03 21:21:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404607369] [2025-03-03 21:21:04,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:04,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 21:21:04,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 21:21:04,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:04,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404607369] [2025-03-03 21:21:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404607369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:21:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943892374] [2025-03-03 21:21:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:21:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:21:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:21:10,202 INFO L87 Difference]: Start difference. First operand 2416 states and 3851 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:11,587 INFO L93 Difference]: Finished difference Result 7615 states and 12002 transitions. [2025-03-03 21:21:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:21:11,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-03 21:21:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:11,610 INFO L225 Difference]: With dead ends: 7615 [2025-03-03 21:21:11,611 INFO L226 Difference]: Without dead ends: 5317 [2025-03-03 21:21:11,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:21:11,617 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 873 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:11,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1097 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:21:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2025-03-03 21:21:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 2447. [2025-03-03 21:21:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 1814 states have (on average 1.4906284454244763) internal successors, (2704), 1830 states have internal predecessors, (2704), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3908 transitions. [2025-03-03 21:21:11,799 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3908 transitions. Word has length 308 [2025-03-03 21:21:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 3908 transitions. [2025-03-03 21:21:11,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3908 transitions. [2025-03-03 21:21:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 21:21:11,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:11,802 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:21:11,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:11,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1620354993, now seen corresponding path program 1 times [2025-03-03 21:21:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:11,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965405449] [2025-03-03 21:21:11,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:11,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 21:21:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 21:21:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965405449] [2025-03-03 21:21:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965405449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:21:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290444179] [2025-03-03 21:21:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:21:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:17,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:21:17,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:21:17,530 INFO L87 Difference]: Start difference. First operand 2447 states and 3908 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:19,674 INFO L93 Difference]: Finished difference Result 6761 states and 10705 transitions. [2025-03-03 21:21:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:21:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-03 21:21:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:19,688 INFO L225 Difference]: With dead ends: 6761 [2025-03-03 21:21:19,688 INFO L226 Difference]: Without dead ends: 4463 [2025-03-03 21:21:19,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:21:19,695 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 443 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:19,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1357 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:21:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2025-03-03 21:21:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 2645. [2025-03-03 21:21:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2012 states have (on average 1.5009940357852882) internal successors, (3020), 2028 states have internal predecessors, (3020), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4224 transitions. [2025-03-03 21:21:19,891 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4224 transitions. Word has length 308 [2025-03-03 21:21:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:19,892 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 4224 transitions. [2025-03-03 21:21:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4224 transitions. [2025-03-03 21:21:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 21:21:19,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:19,896 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:21:19,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 169988141, now seen corresponding path program 1 times [2025-03-03 21:21:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5495923] [2025-03-03 21:21:19,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:19,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 21:21:19,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 21:21:19,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:19,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5495923] [2025-03-03 21:21:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5495923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:21:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024052772] [2025-03-03 21:21:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:23,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:21:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:23,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:21:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:21:23,119 INFO L87 Difference]: Start difference. First operand 2645 states and 4224 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:24,530 INFO L93 Difference]: Finished difference Result 7259 states and 11467 transitions. [2025-03-03 21:21:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:21:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-03 21:21:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:24,546 INFO L225 Difference]: With dead ends: 7259 [2025-03-03 21:21:24,546 INFO L226 Difference]: Without dead ends: 4961 [2025-03-03 21:21:24,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:21:24,553 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 685 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:24,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1199 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:21:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2025-03-03 21:21:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 2661. [2025-03-03 21:21:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2028 states have (on average 1.504930966469428) internal successors, (3052), 2044 states have internal predecessors, (3052), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4256 transitions. [2025-03-03 21:21:24,768 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4256 transitions. Word has length 308 [2025-03-03 21:21:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:24,769 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 4256 transitions. [2025-03-03 21:21:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-03 21:21:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4256 transitions. [2025-03-03 21:21:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 21:21:24,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:24,773 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:24,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:21:24,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:24,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1677539950, now seen corresponding path program 1 times [2025-03-03 21:21:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456468932] [2025-03-03 21:21:24,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:24,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 21:21:24,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 21:21:24,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:24,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:21:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-03 21:21:29,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:21:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456468932] [2025-03-03 21:21:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456468932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:21:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:21:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:21:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617008585] [2025-03-03 21:21:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:21:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:21:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:21:29,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:21:29,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:21:29,218 INFO L87 Difference]: Start difference. First operand 2661 states and 4256 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:21:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:21:30,857 INFO L93 Difference]: Finished difference Result 6951 states and 10999 transitions. [2025-03-03 21:21:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:21:30,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-03-03 21:21:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:21:30,871 INFO L225 Difference]: With dead ends: 6951 [2025-03-03 21:21:30,871 INFO L226 Difference]: Without dead ends: 4653 [2025-03-03 21:21:30,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:21:30,877 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 771 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:21:30,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1364 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:21:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2025-03-03 21:21:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 2645. [2025-03-03 21:21:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2012 states have (on average 1.5009940357852882) internal successors, (3020), 2028 states have internal predecessors, (3020), 602 states have call successors, (602), 30 states have call predecessors, (602), 30 states have return successors, (602), 586 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-03 21:21:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4224 transitions. [2025-03-03 21:21:31,064 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4224 transitions. Word has length 308 [2025-03-03 21:21:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:21:31,065 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 4224 transitions. [2025-03-03 21:21:31,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 21:21:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4224 transitions. [2025-03-03 21:21:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 21:21:31,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:21:31,068 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:31,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:21:31,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:21:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:21:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash -870995795, now seen corresponding path program 1 times [2025-03-03 21:21:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:21:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083669122] [2025-03-03 21:21:31,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:21:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:21:31,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 21:21:31,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 21:21:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:21:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat