./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.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 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:10:53,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:10:53,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:10:53,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:10:53,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:10:53,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:10:53,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:10:53,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:10:53,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:10:53,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:10:53,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:10:53,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:10:53,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:10:53,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:10:53,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:10:53,752 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:10:53,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:53,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:10:53,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:10:53,753 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 -> 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df [2025-03-17 03:10:53,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:10:53,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:10:53,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:10:53,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:10:53,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:10:53,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-17 03:10:55,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a78c666/779788197e8b47119d4e5893693b29fe/FLAGdff8faf79 [2025-03-17 03:10:55,409 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:10:55,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-17 03:10:55,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a78c666/779788197e8b47119d4e5893693b29fe/FLAGdff8faf79 [2025-03-17 03:10:55,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a78c666/779788197e8b47119d4e5893693b29fe [2025-03-17 03:10:55,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:10:55,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:10:55,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:55,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:10:55,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:10:55,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcfcf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55, skipping insertion in model container [2025-03-17 03:10:55,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:10:55,560 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_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-03-17 03:10:55,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:55,642 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:10:55,651 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_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-03-17 03:10:55,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:10:55,697 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:10:55,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55 WrapperNode [2025-03-17 03:10:55,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:10:55,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:55,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:10:55,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:10:55,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,749 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-03-17 03:10:55,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:10:55,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:10:55,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:10:55,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:10:55,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,785 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:10:55,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:10:55,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:10:55,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:10:55,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:10:55,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (1/1) ... [2025-03-17 03:10:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:10:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:55,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:10:55,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:10:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:10:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:10:55,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:10:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:10:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:10:55,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:10:55,949 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:10:55,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:10:56,446 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-17 03:10:56,509 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-17 03:10:56,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:10:56,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:10:56,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:10:56,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:56 BoogieIcfgContainer [2025-03-17 03:10:56,536 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:10:56,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:10:56,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:10:56,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:10:56,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:10:55" (1/3) ... [2025-03-17 03:10:56,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c1af45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:56, skipping insertion in model container [2025-03-17 03:10:56,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:10:55" (2/3) ... [2025-03-17 03:10:56,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c1af45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:10:56, skipping insertion in model container [2025-03-17 03:10:56,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:10:56" (3/3) ... [2025-03-17 03:10:56,546 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-17 03:10:56,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:10:56,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:10:56,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:10:56,665 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;@22a5b19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:10:56,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:10:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:10:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 03:10:56,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:56,683 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:56,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:56,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 716620287, now seen corresponding path program 1 times [2025-03-17 03:10:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361042076] [2025-03-17 03:10:56,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:56,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:10:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:10:56,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 03:10:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361042076] [2025-03-17 03:10:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361042076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:10:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022439377] [2025-03-17 03:10:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:57,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:10:57,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:10:57,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:10:57,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:10:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:10:57,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:10:57,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:57,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:10:57,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:10:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 03:10:57,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:10:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022439377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:57,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:10:57,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:10:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897496023] [2025-03-17 03:10:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:10:57,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:57,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:10:57,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:57,252 INFO L87 Difference]: Start difference. First operand has 112 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:10:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:57,294 INFO L93 Difference]: Finished difference Result 223 states and 373 transitions. [2025-03-17 03:10:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:10:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 188 [2025-03-17 03:10:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:57,302 INFO L225 Difference]: With dead ends: 223 [2025-03-17 03:10:57,302 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 03:10:57,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:10:57,310 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:57,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:10:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 03:10:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 03:10:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:10:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 169 transitions. [2025-03-17 03:10:57,346 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 169 transitions. Word has length 188 [2025-03-17 03:10:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 169 transitions. [2025-03-17 03:10:57,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:10:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 169 transitions. [2025-03-17 03:10:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 03:10:57,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:57,350 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:57,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:10:57,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:10:57,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash -579882309, now seen corresponding path program 1 times [2025-03-17 03:10:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372259892] [2025-03-17 03:10:57,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:57,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 03:10:57,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 03:10:57,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:57,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:10:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372259892] [2025-03-17 03:10:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372259892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:10:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418061078] [2025-03-17 03:10:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:58,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:10:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:58,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:10:58,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:10:58,180 INFO L87 Difference]: Start difference. First operand 110 states and 169 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:10:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:58,437 INFO L93 Difference]: Finished difference Result 368 states and 562 transitions. [2025-03-17 03:10:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:10:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2025-03-17 03:10:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:58,439 INFO L225 Difference]: With dead ends: 368 [2025-03-17 03:10:58,439 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 03:10:58,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:10:58,442 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 247 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:58,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 461 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:10:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 03:10:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2025-03-17 03:10:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 154 states have internal predecessors, (213), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:10:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 325 transitions. [2025-03-17 03:10:58,470 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 325 transitions. Word has length 188 [2025-03-17 03:10:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:58,471 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 325 transitions. [2025-03-17 03:10:58,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:10:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 325 transitions. [2025-03-17 03:10:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:10:58,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:58,473 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:58,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:10:58,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:58,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 517645891, now seen corresponding path program 1 times [2025-03-17 03:10:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:58,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602183574] [2025-03-17 03:10:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:58,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:10:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:10:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:10:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:10:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602183574] [2025-03-17 03:10:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602183574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:10:58,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:10:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:10:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018043337] [2025-03-17 03:10:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:10:58,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:10:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:10:58,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:10:58,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:10:58,878 INFO L87 Difference]: Start difference. First operand 213 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:10:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:59,235 INFO L93 Difference]: Finished difference Result 573 states and 871 transitions. [2025-03-17 03:10:59,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:10:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2025-03-17 03:10:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:59,241 INFO L225 Difference]: With dead ends: 573 [2025-03-17 03:10:59,241 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 03:10:59,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:10:59,243 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 104 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:59,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 516 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:10:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 03:10:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 277. [2025-03-17 03:10:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 189 states have internal predecessors, (255), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:10:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 423 transitions. [2025-03-17 03:10:59,301 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 423 transitions. Word has length 189 [2025-03-17 03:10:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:59,302 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 423 transitions. [2025-03-17 03:10:59,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:10:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 423 transitions. [2025-03-17 03:10:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:10:59,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:59,305 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:10:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:10:59,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 728996804, now seen corresponding path program 1 times [2025-03-17 03:10:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:10:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436053338] [2025-03-17 03:10:59,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:10:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:10:59,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:10:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:59,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436053338] [2025-03-17 03:11:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436053338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:11:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204623986] [2025-03-17 03:11:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:00,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:11:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:00,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:11:00,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:11:00,120 INFO L87 Difference]: Start difference. First operand 277 states and 423 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:01,182 INFO L93 Difference]: Finished difference Result 941 states and 1435 transitions. [2025-03-17 03:11:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:11:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2025-03-17 03:11:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:01,187 INFO L225 Difference]: With dead ends: 941 [2025-03-17 03:11:01,188 INFO L226 Difference]: Without dead ends: 729 [2025-03-17 03:11:01,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:11:01,189 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 407 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:01,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 776 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:11:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-17 03:11:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 400. [2025-03-17 03:11:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 283 states have (on average 1.3745583038869258) internal successors, (389), 283 states have internal predecessors, (389), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 03:11:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 613 transitions. [2025-03-17 03:11:01,283 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 613 transitions. Word has length 189 [2025-03-17 03:11:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:01,284 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 613 transitions. [2025-03-17 03:11:01,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 613 transitions. [2025-03-17 03:11:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-17 03:11:01,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:01,286 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:01,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:11:01,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:01,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2058418683, now seen corresponding path program 1 times [2025-03-17 03:11:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727349411] [2025-03-17 03:11:01,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:01,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-17 03:11:01,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-17 03:11:01,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:01,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727349411] [2025-03-17 03:11:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727349411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:11:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003702137] [2025-03-17 03:11:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:01,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:11:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:01,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:11:01,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:11:01,640 INFO L87 Difference]: Start difference. First operand 400 states and 613 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:02,459 INFO L93 Difference]: Finished difference Result 1284 states and 1966 transitions. [2025-03-17 03:11:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:11:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2025-03-17 03:11:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:02,467 INFO L225 Difference]: With dead ends: 1284 [2025-03-17 03:11:02,467 INFO L226 Difference]: Without dead ends: 949 [2025-03-17 03:11:02,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:11:02,470 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 597 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:02,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 700 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:11:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-03-17 03:11:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 525. [2025-03-17 03:11:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 379 states have (on average 1.3931398416886545) internal successors, (528), 379 states have internal predecessors, (528), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 03:11:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 808 transitions. [2025-03-17 03:11:02,562 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 808 transitions. Word has length 189 [2025-03-17 03:11:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 808 transitions. [2025-03-17 03:11:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 808 transitions. [2025-03-17 03:11:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 03:11:02,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:02,564 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:02,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:11:02,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:02,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1796590761, now seen corresponding path program 1 times [2025-03-17 03:11:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:02,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793924509] [2025-03-17 03:11:02,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:02,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 03:11:02,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 03:11:02,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793924509] [2025-03-17 03:11:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793924509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:11:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973652213] [2025-03-17 03:11:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:02,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:11:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:02,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:11:02,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:11:02,891 INFO L87 Difference]: Start difference. First operand 525 states and 808 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:03,678 INFO L93 Difference]: Finished difference Result 1667 states and 2566 transitions. [2025-03-17 03:11:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:11:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2025-03-17 03:11:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:03,687 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 03:11:03,687 INFO L226 Difference]: Without dead ends: 1207 [2025-03-17 03:11:03,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:11:03,693 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 289 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:03,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 616 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:11:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-03-17 03:11:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1203. [2025-03-17 03:11:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 883 states have (on average 1.391845979614949) internal successors, (1229), 883 states have internal predecessors, (1229), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:11:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1845 transitions. [2025-03-17 03:11:03,929 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1845 transitions. Word has length 190 [2025-03-17 03:11:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:03,930 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1845 transitions. [2025-03-17 03:11:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1845 transitions. [2025-03-17 03:11:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 03:11:03,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:03,932 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:11:03,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1729584008, now seen corresponding path program 1 times [2025-03-17 03:11:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:03,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274392562] [2025-03-17 03:11:03,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:03,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 03:11:03,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 03:11:03,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:03,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:04,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274392562] [2025-03-17 03:11:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274392562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:04,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:11:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866774664] [2025-03-17 03:11:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:04,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:11:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:04,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:11:04,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:11:04,114 INFO L87 Difference]: Start difference. First operand 1203 states and 1845 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:04,489 INFO L93 Difference]: Finished difference Result 2103 states and 3231 transitions. [2025-03-17 03:11:04,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:11:04,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2025-03-17 03:11:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:04,501 INFO L225 Difference]: With dead ends: 2103 [2025-03-17 03:11:04,502 INFO L226 Difference]: Without dead ends: 1643 [2025-03-17 03:11:04,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:11:04,504 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 163 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:04,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 399 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:11:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-17 03:11:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 965. [2025-03-17 03:11:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 703 states have (on average 1.3826458036984353) internal successors, (972), 703 states have internal predecessors, (972), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-17 03:11:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1476 transitions. [2025-03-17 03:11:04,629 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1476 transitions. Word has length 190 [2025-03-17 03:11:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:04,630 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1476 transitions. [2025-03-17 03:11:04,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1476 transitions. [2025-03-17 03:11:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 03:11:04,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:04,634 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:04,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:11:04,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash 964628320, now seen corresponding path program 1 times [2025-03-17 03:11:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547750229] [2025-03-17 03:11:04,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:04,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 03:11:04,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 03:11:04,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:04,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547750229] [2025-03-17 03:11:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547750229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:11:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792595188] [2025-03-17 03:11:04,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:04,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:11:04,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:04,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:11:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:11:04,745 INFO L87 Difference]: Start difference. First operand 965 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:04,915 INFO L93 Difference]: Finished difference Result 1943 states and 2975 transitions. [2025-03-17 03:11:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:11:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-03-17 03:11:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:04,924 INFO L225 Difference]: With dead ends: 1943 [2025-03-17 03:11:04,925 INFO L226 Difference]: Without dead ends: 1045 [2025-03-17 03:11:04,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:11:04,928 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:04,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:11:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-17 03:11:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 965. [2025-03-17 03:11:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 703 states have (on average 1.3769559032716927) internal successors, (968), 703 states have internal predecessors, (968), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-17 03:11:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1472 transitions. [2025-03-17 03:11:05,027 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1472 transitions. Word has length 191 [2025-03-17 03:11:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:05,027 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1472 transitions. [2025-03-17 03:11:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1472 transitions. [2025-03-17 03:11:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:11:05,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:05,030 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:05,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:11:05,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1744019622, now seen corresponding path program 1 times [2025-03-17 03:11:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:05,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375458654] [2025-03-17 03:11:05,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:05,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:11:05,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:11:05,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375458654] [2025-03-17 03:11:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375458654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:11:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849770130] [2025-03-17 03:11:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:05,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:11:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:05,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:11:05,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:11:05,712 INFO L87 Difference]: Start difference. First operand 965 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:07,122 INFO L93 Difference]: Finished difference Result 2179 states and 3316 transitions. [2025-03-17 03:11:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:11:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-17 03:11:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:07,131 INFO L225 Difference]: With dead ends: 2179 [2025-03-17 03:11:07,132 INFO L226 Difference]: Without dead ends: 1281 [2025-03-17 03:11:07,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:11:07,137 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 456 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:07,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 787 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:11:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2025-03-17 03:11:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1188. [2025-03-17 03:11:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 868 states have (on average 1.3755760368663594) internal successors, (1194), 868 states have internal predecessors, (1194), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:11:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1810 transitions. [2025-03-17 03:11:07,344 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1810 transitions. Word has length 192 [2025-03-17 03:11:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1810 transitions. [2025-03-17 03:11:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1810 transitions. [2025-03-17 03:11:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:11:07,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:07,347 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:11:07,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1964500883, now seen corresponding path program 1 times [2025-03-17 03:11:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845633696] [2025-03-17 03:11:07,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:11:07,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:11:07,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:07,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-17 03:11:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845633696] [2025-03-17 03:11:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845633696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:11:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629256652] [2025-03-17 03:11:07,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:07,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:11:07,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:11:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:11:07,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:11:07,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:07,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:11:07,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:08,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:11:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629256652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:11:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-17 03:11:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157919495] [2025-03-17 03:11:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:11:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:08,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:11:08,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:11:08,059 INFO L87 Difference]: Start difference. First operand 1188 states and 1810 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:08,502 INFO L93 Difference]: Finished difference Result 2800 states and 4273 transitions. [2025-03-17 03:11:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:11:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-17 03:11:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:08,514 INFO L225 Difference]: With dead ends: 2800 [2025-03-17 03:11:08,514 INFO L226 Difference]: Without dead ends: 1898 [2025-03-17 03:11:08,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:11:08,518 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 214 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:08,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1120 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:11:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-17 03:11:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1630. [2025-03-17 03:11:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1194 states have (on average 1.3601340033500837) internal successors, (1624), 1194 states have internal predecessors, (1624), 420 states have call successors, (420), 15 states have call predecessors, (420), 15 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:11:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2464 transitions. [2025-03-17 03:11:08,702 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2464 transitions. Word has length 192 [2025-03-17 03:11:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:08,702 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2464 transitions. [2025-03-17 03:11:08,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2464 transitions. [2025-03-17 03:11:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 03:11:08,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:08,705 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:08,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:11:08,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 03:11:08,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1775039429, now seen corresponding path program 1 times [2025-03-17 03:11:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949661208] [2025-03-17 03:11:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:08,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 03:11:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 03:11:08,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:08,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:09,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949661208] [2025-03-17 03:11:09,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949661208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:09,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:09,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:11:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381525521] [2025-03-17 03:11:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:09,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:11:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:09,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:11:09,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:11:09,559 INFO L87 Difference]: Start difference. First operand 1630 states and 2464 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:11,222 INFO L93 Difference]: Finished difference Result 3157 states and 4764 transitions. [2025-03-17 03:11:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:11:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-17 03:11:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:11,236 INFO L225 Difference]: With dead ends: 3157 [2025-03-17 03:11:11,237 INFO L226 Difference]: Without dead ends: 1817 [2025-03-17 03:11:11,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:11:11,243 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 329 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:11,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 884 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:11:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-03-17 03:11:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1408. [2025-03-17 03:11:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1030 states have (on average 1.358252427184466) internal successors, (1399), 1030 states have internal predecessors, (1399), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-17 03:11:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 2127 transitions. [2025-03-17 03:11:11,443 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 2127 transitions. Word has length 192 [2025-03-17 03:11:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 2127 transitions. [2025-03-17 03:11:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 2127 transitions. [2025-03-17 03:11:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:11:11,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:11,446 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:11,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:11:11,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:11,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -26357696, now seen corresponding path program 1 times [2025-03-17 03:11:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479534704] [2025-03-17 03:11:11,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:11,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:11,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:11,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479534704] [2025-03-17 03:11:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479534704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:11,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:11:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571460982] [2025-03-17 03:11:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:11,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:11:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:11,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:11:11,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:11:11,608 INFO L87 Difference]: Start difference. First operand 1408 states and 2127 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:12,115 INFO L93 Difference]: Finished difference Result 4281 states and 6485 transitions. [2025-03-17 03:11:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:11:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-03-17 03:11:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:12,137 INFO L225 Difference]: With dead ends: 4281 [2025-03-17 03:11:12,137 INFO L226 Difference]: Without dead ends: 2940 [2025-03-17 03:11:12,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:11:12,142 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 214 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:12,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 543 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:11:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-03-17 03:11:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2408. [2025-03-17 03:11:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1798 states have (on average 1.367074527252503) internal successors, (2458), 1798 states have internal predecessors, (2458), 588 states have call successors, (588), 21 states have call predecessors, (588), 21 states have return successors, (588), 588 states have call predecessors, (588), 588 states have call successors, (588) [2025-03-17 03:11:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3634 transitions. [2025-03-17 03:11:12,460 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3634 transitions. Word has length 193 [2025-03-17 03:11:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:12,461 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3634 transitions. [2025-03-17 03:11:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3634 transitions. [2025-03-17 03:11:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:11:12,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:12,464 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:11:12,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1190706103, now seen corresponding path program 1 times [2025-03-17 03:11:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015357892] [2025-03-17 03:11:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:12,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:12,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-17 03:11:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015357892] [2025-03-17 03:11:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015357892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:11:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872091036] [2025-03-17 03:11:13,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:13,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:13,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:11:13,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:11:13,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:13,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:13,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:13,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:13,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:11:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-03-17 03:11:13,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:11:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-17 03:11:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872091036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:11:13,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:11:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-17 03:11:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713929489] [2025-03-17 03:11:13,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:11:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:11:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:13,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:11:13,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:11:13,535 INFO L87 Difference]: Start difference. First operand 2408 states and 3634 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:11:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:14,101 INFO L93 Difference]: Finished difference Result 3784 states and 5595 transitions. [2025-03-17 03:11:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:11:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 193 [2025-03-17 03:11:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:14,110 INFO L225 Difference]: With dead ends: 3784 [2025-03-17 03:11:14,110 INFO L226 Difference]: Without dead ends: 1443 [2025-03-17 03:11:14,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:11:14,117 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 584 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:14,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 306 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:11:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-17 03:11:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1357. [2025-03-17 03:11:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1015 states have (on average 1.3300492610837438) internal successors, (1350), 1015 states have internal predecessors, (1350), 308 states have call successors, (308), 33 states have call predecessors, (308), 33 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-17 03:11:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1966 transitions. [2025-03-17 03:11:14,321 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1966 transitions. Word has length 193 [2025-03-17 03:11:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:14,321 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1966 transitions. [2025-03-17 03:11:14,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 03:11:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1966 transitions. [2025-03-17 03:11:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:11:14,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:14,323 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:14,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:11:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:14,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:14,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash -987971713, now seen corresponding path program 1 times [2025-03-17 03:11:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:14,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013941183] [2025-03-17 03:11:14,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:14,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:14,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:14,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013941183] [2025-03-17 03:11:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013941183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:11:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305572912] [2025-03-17 03:11:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:11:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:11:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:11:14,747 INFO L87 Difference]: Start difference. First operand 1357 states and 1966 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:15,800 INFO L93 Difference]: Finished difference Result 4013 states and 5814 transitions. [2025-03-17 03:11:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:11:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-03-17 03:11:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:15,816 INFO L225 Difference]: With dead ends: 4013 [2025-03-17 03:11:15,817 INFO L226 Difference]: Without dead ends: 2731 [2025-03-17 03:11:15,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:11:15,820 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 275 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 802 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:11:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2025-03-17 03:11:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 1954. [2025-03-17 03:11:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1488 states have (on average 1.3333333333333333) internal successors, (1984), 1488 states have internal predecessors, (1984), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:11:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2824 transitions. [2025-03-17 03:11:16,203 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2824 transitions. Word has length 193 [2025-03-17 03:11:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2824 transitions. [2025-03-17 03:11:16,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2824 transitions. [2025-03-17 03:11:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 03:11:16,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:16,208 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:11:16,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1078530242, now seen corresponding path program 1 times [2025-03-17 03:11:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340814812] [2025-03-17 03:11:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:16,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:16,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:16,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:16,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:11:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340814812] [2025-03-17 03:11:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340814812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:11:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082711158] [2025-03-17 03:11:17,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:17,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:11:17,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:11:17,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 03:11:17,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 03:11:17,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:17,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 03:11:17,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:11:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:18,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:11:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082711158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:11:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2025-03-17 03:11:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896914282] [2025-03-17 03:11:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:11:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:11:18,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:11:18,706 INFO L87 Difference]: Start difference. First operand 1954 states and 2824 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:19,442 INFO L93 Difference]: Finished difference Result 3248 states and 4674 transitions. [2025-03-17 03:11:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:11:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-03-17 03:11:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:19,456 INFO L225 Difference]: With dead ends: 3248 [2025-03-17 03:11:19,456 INFO L226 Difference]: Without dead ends: 2203 [2025-03-17 03:11:19,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:11:19,463 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 178 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:19,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 636 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:11:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2025-03-17 03:11:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2005. [2025-03-17 03:11:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1539 states have (on average 1.3339831059129306) internal successors, (2053), 1539 states have internal predecessors, (2053), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-17 03:11:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2893 transitions. [2025-03-17 03:11:19,843 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2893 transitions. Word has length 193 [2025-03-17 03:11:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:19,843 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2893 transitions. [2025-03-17 03:11:19,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2893 transitions. [2025-03-17 03:11:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 03:11:19,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:19,845 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:19,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 03:11:20,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 03:11:20,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1517187388, now seen corresponding path program 1 times [2025-03-17 03:11:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007229934] [2025-03-17 03:11:20,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:20,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 03:11:20,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 03:11:20,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:20,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007229934] [2025-03-17 03:11:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007229934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:20,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:11:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390378568] [2025-03-17 03:11:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:11:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:20,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:11:20,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:11:20,358 INFO L87 Difference]: Start difference. First operand 2005 states and 2893 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:21,068 INFO L93 Difference]: Finished difference Result 3610 states and 5214 transitions. [2025-03-17 03:11:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:11:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-03-17 03:11:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:21,085 INFO L225 Difference]: With dead ends: 3610 [2025-03-17 03:11:21,086 INFO L226 Difference]: Without dead ends: 1859 [2025-03-17 03:11:21,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:11:21,093 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:21,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 450 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:11:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-17 03:11:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2025-03-17 03:11:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1422 states have (on average 1.3333333333333333) internal successors, (1896), 1422 states have internal predecessors, (1896), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-17 03:11:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2680 transitions. [2025-03-17 03:11:21,485 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2680 transitions. Word has length 194 [2025-03-17 03:11:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:21,486 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2680 transitions. [2025-03-17 03:11:21,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2680 transitions. [2025-03-17 03:11:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 03:11:21,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:21,487 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:11:21,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:21,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1771923933, now seen corresponding path program 1 times [2025-03-17 03:11:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:21,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415893406] [2025-03-17 03:11:21,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 03:11:21,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 03:11:21,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:21,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:11:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:11:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:11:21,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415893406] [2025-03-17 03:11:21,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415893406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:11:21,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:11:21,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:11:21,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880058569] [2025-03-17 03:11:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:11:21,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:11:21,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:11:21,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:11:21,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:11:21,973 INFO L87 Difference]: Start difference. First operand 1857 states and 2680 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:11:22,860 INFO L93 Difference]: Finished difference Result 3788 states and 5453 transitions. [2025-03-17 03:11:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:11:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-03-17 03:11:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:11:22,876 INFO L225 Difference]: With dead ends: 3788 [2025-03-17 03:11:22,876 INFO L226 Difference]: Without dead ends: 2195 [2025-03-17 03:11:22,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:11:22,882 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 311 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:11:22,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 578 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:11:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-03-17 03:11:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1864. [2025-03-17 03:11:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1429 states have (on average 1.3296011196641007) internal successors, (1900), 1429 states have internal predecessors, (1900), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392) [2025-03-17 03:11:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2684 transitions. [2025-03-17 03:11:23,219 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2684 transitions. Word has length 194 [2025-03-17 03:11:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:11:23,220 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2684 transitions. [2025-03-17 03:11:23,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:11:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2684 transitions. [2025-03-17 03:11:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-17 03:11:23,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:11:23,222 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:11:23,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:11:23,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:11:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:11:23,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1814313783, now seen corresponding path program 1 times [2025-03-17 03:11:23,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:11:23,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726989558] [2025-03-17 03:11:23,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:11:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 03:11:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 03:11:23,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:11:23,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:11:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615503861] [2025-03-17 03:11:23,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:11:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:11:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:11:23,301 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:11:23,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 03:11:23,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.