./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-84.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 a38816720abe2c19fbd70680349ed59f349bca0e0acac641469a31f37cd07bb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:37:04,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:37:04,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:37:04,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:37:04,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:37:04,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:37:04,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:37:04,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:37:04,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:37:04,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:37:04,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:37:04,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:37:04,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:37:04,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:37:04,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:37:04,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:37:04,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:37:04,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:04,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:37:04,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:37:04,501 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 -> a38816720abe2c19fbd70680349ed59f349bca0e0acac641469a31f37cd07bb9 [2025-03-04 00:37:04,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:37:04,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:37:04,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:37:04,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:37:04,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:37:04,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-84.i [2025-03-04 00:37:05,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a670fde9/6bea120dfc27479b849ed090279b5d3f/FLAG4b1086c8a [2025-03-04 00:37:06,149 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:37:06,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-84.i [2025-03-04 00:37:06,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a670fde9/6bea120dfc27479b849ed090279b5d3f/FLAG4b1086c8a [2025-03-04 00:37:06,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a670fde9/6bea120dfc27479b849ed090279b5d3f [2025-03-04 00:37:06,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:37:06,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:37:06,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:06,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:37:06,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:37:06,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3750e0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06, skipping insertion in model container [2025-03-04 00:37:06,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:37:06,318 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_operatoramount_amount500_file-84.i[916,929] [2025-03-04 00:37:06,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:06,498 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:37:06,510 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_operatoramount_amount500_file-84.i[916,929] [2025-03-04 00:37:06,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:06,625 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:37:06,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06 WrapperNode [2025-03-04 00:37:06,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:06,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:06,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:37:06,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:37:06,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,753 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 684 [2025-03-04 00:37:06,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:06,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:37:06,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:37:06,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:37:06,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,879 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-04 00:37:06,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:37:06,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:37:06,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:37:06,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:37:06,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (1/1) ... [2025-03-04 00:37:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:06,980 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-04 00:37:06,982 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-04 00:37:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:37:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:37:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:37:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:37:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:37:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:37:07,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:37:07,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:37:08,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L652: havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1; [2025-03-04 00:37:08,170 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-04 00:37:08,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:37:08,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:37:08,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:37:08,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:08 BoogieIcfgContainer [2025-03-04 00:37:08,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:37:08,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:37:08,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:37:08,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:37:08,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:37:06" (1/3) ... [2025-03-04 00:37:08,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d36baca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:08, skipping insertion in model container [2025-03-04 00:37:08,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:06" (2/3) ... [2025-03-04 00:37:08,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d36baca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:08, skipping insertion in model container [2025-03-04 00:37:08,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:08" (3/3) ... [2025-03-04 00:37:08,209 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-84.i [2025-03-04 00:37:08,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:37:08,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-84.i that has 2 procedures, 281 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:37:08,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:37:08,292 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;@e3d1226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:37:08,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:37:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 281 states, 201 states have (on average 1.5621890547263682) internal successors, (314), 202 states have internal predecessors, (314), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-04 00:37:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-04 00:37:08,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:08,321 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:08,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:08,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash -891549491, now seen corresponding path program 1 times [2025-03-04 00:37:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001727723] [2025-03-04 00:37:08,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:08,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 00:37:08,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 00:37:08,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:08,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001727723] [2025-03-04 00:37:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001727723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:09,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759299445] [2025-03-04 00:37:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:09,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:09,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:09,214 INFO L87 Difference]: Start difference. First operand has 281 states, 201 states have (on average 1.5621890547263682) internal successors, (314), 202 states have internal predecessors, (314), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:09,399 INFO L93 Difference]: Finished difference Result 821 states and 1528 transitions. [2025-03-04 00:37:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 512 [2025-03-04 00:37:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:09,416 INFO L225 Difference]: With dead ends: 821 [2025-03-04 00:37:09,416 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 00:37:09,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:09,423 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 432 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:09,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1011 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 00:37:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 351. [2025-03-04 00:37:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 272 states have (on average 1.6029411764705883) internal successors, (436), 272 states have internal predecessors, (436), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-04 00:37:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 590 transitions. [2025-03-04 00:37:09,513 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 590 transitions. Word has length 512 [2025-03-04 00:37:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:09,515 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 590 transitions. [2025-03-04 00:37:09,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 590 transitions. [2025-03-04 00:37:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-04 00:37:09,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:09,525 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:09,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:37:09,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:09,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1522008116, now seen corresponding path program 1 times [2025-03-04 00:37:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178203362] [2025-03-04 00:37:09,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:09,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 00:37:10,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 00:37:10,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:10,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:11,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178203362] [2025-03-04 00:37:11,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178203362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:11,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:11,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762763605] [2025-03-04 00:37:11,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:11,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:11,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:11,446 INFO L87 Difference]: Start difference. First operand 351 states and 590 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:11,903 INFO L93 Difference]: Finished difference Result 1048 states and 1765 transitions. [2025-03-04 00:37:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 512 [2025-03-04 00:37:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:11,909 INFO L225 Difference]: With dead ends: 1048 [2025-03-04 00:37:11,909 INFO L226 Difference]: Without dead ends: 700 [2025-03-04 00:37:11,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:11,911 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 327 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:11,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1576 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-04 00:37:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 484. [2025-03-04 00:37:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 327 states have (on average 1.510703363914373) internal successors, (494), 327 states have internal predecessors, (494), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-04 00:37:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2025-03-04 00:37:11,970 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 512 [2025-03-04 00:37:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:11,971 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2025-03-04 00:37:11,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2025-03-04 00:37:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:11,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:11,981 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:37:11,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:11,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash 152037041, now seen corresponding path program 1 times [2025-03-04 00:37:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:11,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965329987] [2025-03-04 00:37:11,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:11,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:12,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965329987] [2025-03-04 00:37:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965329987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:13,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:37:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829097262] [2025-03-04 00:37:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:13,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:37:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:37:13,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:37:13,843 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:15,299 INFO L93 Difference]: Finished difference Result 1872 states and 3096 transitions. [2025-03-04 00:37:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:37:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 514 [2025-03-04 00:37:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:15,307 INFO L225 Difference]: With dead ends: 1872 [2025-03-04 00:37:15,308 INFO L226 Difference]: Without dead ends: 1524 [2025-03-04 00:37:15,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:37:15,310 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 2098 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:15,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 2363 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:37:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-03-04 00:37:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1179. [2025-03-04 00:37:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 915 states have (on average 1.5759562841530055) internal successors, (1442), 917 states have internal predecessors, (1442), 257 states have call successors, (257), 6 states have call predecessors, (257), 6 states have return successors, (257), 255 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-04 00:37:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1956 transitions. [2025-03-04 00:37:15,422 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1956 transitions. Word has length 514 [2025-03-04 00:37:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1956 transitions. [2025-03-04 00:37:15,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1956 transitions. [2025-03-04 00:37:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:15,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:15,432 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:37:15,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 845138738, now seen corresponding path program 1 times [2025-03-04 00:37:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996463204] [2025-03-04 00:37:15,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:15,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996463204] [2025-03-04 00:37:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996463204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908117073] [2025-03-04 00:37:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:17,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:17,957 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-04 00:37:17,958 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-04 00:37:18,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:18,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:18,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:18,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:18,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 2388 proven. 24 refuted. 0 times theorem prover too weak. 9292 trivial. 0 not checked. [2025-03-04 00:37:18,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 204 proven. 24 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908117073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:18,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 17 [2025-03-04 00:37:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499228992] [2025-03-04 00:37:18,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:37:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:37:18,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:37:18,875 INFO L87 Difference]: Start difference. First operand 1179 states and 1956 transitions. Second operand has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 6 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 6 states have call predecessors, (163), 6 states have call successors, (163) [2025-03-04 00:37:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:23,958 INFO L93 Difference]: Finished difference Result 4900 states and 8146 transitions. [2025-03-04 00:37:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:37:23,959 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 6 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 6 states have call predecessors, (163), 6 states have call successors, (163) Word has length 514 [2025-03-04 00:37:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:23,975 INFO L225 Difference]: With dead ends: 4900 [2025-03-04 00:37:23,976 INFO L226 Difference]: Without dead ends: 3861 [2025-03-04 00:37:23,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1071 GetRequests, 1029 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 00:37:23,980 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 6946 mSDsluCounter, 3747 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7013 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:23,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7013 Valid, 4315 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 00:37:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2025-03-04 00:37:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 2138. [2025-03-04 00:37:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1775 states have (on average 1.6033802816901408) internal successors, (2846), 1778 states have internal predecessors, (2846), 347 states have call successors, (347), 15 states have call predecessors, (347), 15 states have return successors, (347), 344 states have call predecessors, (347), 347 states have call successors, (347) [2025-03-04 00:37:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3540 transitions. [2025-03-04 00:37:24,125 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3540 transitions. Word has length 514 [2025-03-04 00:37:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:24,126 INFO L471 AbstractCegarLoop]: Abstraction has 2138 states and 3540 transitions. [2025-03-04 00:37:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.588235294117647) internal successors, (231), 17 states have internal predecessors, (231), 6 states have call successors, (162), 2 states have call predecessors, (162), 4 states have return successors, (163), 6 states have call predecessors, (163), 6 states have call successors, (163) [2025-03-04 00:37:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3540 transitions. [2025-03-04 00:37:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:24,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:24,132 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:24,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:24,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:24,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash -844940238, now seen corresponding path program 1 times [2025-03-04 00:37:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14032659] [2025-03-04 00:37:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:24,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:24,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:24,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:24,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:24,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14032659] [2025-03-04 00:37:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14032659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:37:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591962806] [2025-03-04 00:37:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:24,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:37:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:24,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:37:24,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:24,997 INFO L87 Difference]: Start difference. First operand 2138 states and 3540 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:26,039 INFO L93 Difference]: Finished difference Result 6525 states and 10845 transitions. [2025-03-04 00:37:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:37:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:37:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:26,056 INFO L225 Difference]: With dead ends: 6525 [2025-03-04 00:37:26,057 INFO L226 Difference]: Without dead ends: 4535 [2025-03-04 00:37:26,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:37:26,062 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1222 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:26,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3117 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:37:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2025-03-04 00:37:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 3327. [2025-03-04 00:37:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 2776 states have (on average 1.6069884726224783) internal successors, (4461), 2781 states have internal predecessors, (4461), 527 states have call successors, (527), 23 states have call predecessors, (527), 23 states have return successors, (527), 522 states have call predecessors, (527), 527 states have call successors, (527) [2025-03-04 00:37:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5515 transitions. [2025-03-04 00:37:26,263 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5515 transitions. Word has length 514 [2025-03-04 00:37:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:26,264 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5515 transitions. [2025-03-04 00:37:26,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5515 transitions. [2025-03-04 00:37:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:26,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:26,270 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:26,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:37:26,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 47710226, now seen corresponding path program 1 times [2025-03-04 00:37:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188120583] [2025-03-04 00:37:26,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:26,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:27,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:27,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 39 proven. 189 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188120583] [2025-03-04 00:37:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188120583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987023719] [2025-03-04 00:37:27,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:27,830 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-04 00:37:27,831 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-04 00:37:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:28,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:28,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:28,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:28,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:28,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 2848 proven. 30 refuted. 0 times theorem prover too weak. 8826 trivial. 0 not checked. [2025-03-04 00:37:28,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 198 proven. 30 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987023719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:28,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-04 00:37:28,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537385125] [2025-03-04 00:37:28,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:28,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:37:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:37:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:37:28,591 INFO L87 Difference]: Start difference. First operand 3327 states and 5515 transitions. Second operand has 11 states, 11 states have (on average 18.90909090909091) internal successors, (208), 11 states have internal predecessors, (208), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-03-04 00:37:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:30,031 INFO L93 Difference]: Finished difference Result 5209 states and 8558 transitions. [2025-03-04 00:37:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:37:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.90909090909091) internal successors, (208), 11 states have internal predecessors, (208), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) Word has length 514 [2025-03-04 00:37:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:30,043 INFO L225 Difference]: With dead ends: 5209 [2025-03-04 00:37:30,044 INFO L226 Difference]: Without dead ends: 2030 [2025-03-04 00:37:30,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 1025 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:37:30,050 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1914 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:30,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 2254 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:37:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-03-04 00:37:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1256. [2025-03-04 00:37:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 929 states have (on average 1.503767491926803) internal successors, (1397), 929 states have internal predecessors, (1397), 308 states have call successors, (308), 18 states have call predecessors, (308), 18 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-04 00:37:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2013 transitions. [2025-03-04 00:37:30,147 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2013 transitions. Word has length 514 [2025-03-04 00:37:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:30,147 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 2013 transitions. [2025-03-04 00:37:30,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.90909090909091) internal successors, (208), 11 states have internal predecessors, (208), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-03-04 00:37:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2013 transitions. [2025-03-04 00:37:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:30,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:30,151 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:30,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:30,351 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,SelfDestructingSolverStorable5 [2025-03-04 00:37:30,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:30,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash -356323122, now seen corresponding path program 1 times [2025-03-04 00:37:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157450485] [2025-03-04 00:37:30,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:30,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:30,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:30,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:30,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:30,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:31,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157450485] [2025-03-04 00:37:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157450485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:37:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618346963] [2025-03-04 00:37:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:37:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:31,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:37:31,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:31,421 INFO L87 Difference]: Start difference. First operand 1256 states and 2013 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:32,402 INFO L93 Difference]: Finished difference Result 3675 states and 5965 transitions. [2025-03-04 00:37:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:37:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:37:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:32,435 INFO L225 Difference]: With dead ends: 3675 [2025-03-04 00:37:32,435 INFO L226 Difference]: Without dead ends: 2575 [2025-03-04 00:37:32,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:37:32,440 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1779 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:32,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1598 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:37:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2025-03-04 00:37:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1959. [2025-03-04 00:37:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1595 states have (on average 1.54858934169279) internal successors, (2470), 1598 states have internal predecessors, (2470), 341 states have call successors, (341), 22 states have call predecessors, (341), 22 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2025-03-04 00:37:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3152 transitions. [2025-03-04 00:37:32,644 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3152 transitions. Word has length 514 [2025-03-04 00:37:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 3152 transitions. [2025-03-04 00:37:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3152 transitions. [2025-03-04 00:37:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:32,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:32,661 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:32,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:37:32,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:32,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash -115782993, now seen corresponding path program 1 times [2025-03-04 00:37:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:32,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039047593] [2025-03-04 00:37:32,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:33,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 39 proven. 189 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039047593] [2025-03-04 00:37:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039047593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200975654] [2025-03-04 00:37:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:34,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:34,161 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-04 00:37:34,163 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-04 00:37:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:34,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:34,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:34,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:37:34,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5922 proven. 117 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2025-03-04 00:37:35,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 111 proven. 117 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:35,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200975654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:35,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-03-04 00:37:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931935488] [2025-03-04 00:37:35,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:35,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:37:35,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:35,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:37:35,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:37:35,513 INFO L87 Difference]: Start difference. First operand 1959 states and 3152 transitions. Second operand has 17 states, 17 states have (on average 16.941176470588236) internal successors, (288), 17 states have internal predecessors, (288), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) [2025-03-04 00:37:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:37,999 INFO L93 Difference]: Finished difference Result 5841 states and 9542 transitions. [2025-03-04 00:37:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 00:37:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.941176470588236) internal successors, (288), 17 states have internal predecessors, (288), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) Word has length 514 [2025-03-04 00:37:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:38,013 INFO L225 Difference]: With dead ends: 5841 [2025-03-04 00:37:38,013 INFO L226 Difference]: Without dead ends: 4038 [2025-03-04 00:37:38,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 1024 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=597, Invalid=1953, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 00:37:38,017 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 7579 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 2936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7581 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 4263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2936 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:38,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7581 Valid, 2756 Invalid, 4263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2936 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:37:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4038 states. [2025-03-04 00:37:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4038 to 3448. [2025-03-04 00:37:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3448 states, 2988 states have (on average 1.5846720214190093) internal successors, (4735), 2992 states have internal predecessors, (4735), 429 states have call successors, (429), 30 states have call predecessors, (429), 30 states have return successors, (429), 425 states have call predecessors, (429), 429 states have call successors, (429) [2025-03-04 00:37:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 5593 transitions. [2025-03-04 00:37:38,172 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 5593 transitions. Word has length 514 [2025-03-04 00:37:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 3448 states and 5593 transitions. [2025-03-04 00:37:38,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.941176470588236) internal successors, (288), 17 states have internal predecessors, (288), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) [2025-03-04 00:37:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 5593 transitions. [2025-03-04 00:37:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:37:38,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:38,180 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:38,189 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-04 00:37:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:38,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -269708975, now seen corresponding path program 1 times [2025-03-04 00:37:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519855848] [2025-03-04 00:37:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:38,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:37:38,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:37:38,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:38,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519855848] [2025-03-04 00:37:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519855848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:39,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123188985] [2025-03-04 00:37:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:39,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:39,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:39,030 INFO L87 Difference]: Start difference. First operand 3448 states and 5593 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:39,491 INFO L93 Difference]: Finished difference Result 10861 states and 17717 transitions. [2025-03-04 00:37:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:39,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:37:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:39,518 INFO L225 Difference]: With dead ends: 10861 [2025-03-04 00:37:39,518 INFO L226 Difference]: Without dead ends: 7593 [2025-03-04 00:37:39,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:39,525 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 835 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:39,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1462 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2025-03-04 00:37:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 6607. [2025-03-04 00:37:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6607 states, 5944 states have (on average 1.5970726783310902) internal successors, (9493), 5956 states have internal predecessors, (9493), 621 states have call successors, (621), 41 states have call predecessors, (621), 41 states have return successors, (621), 609 states have call predecessors, (621), 621 states have call successors, (621) [2025-03-04 00:37:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 10735 transitions. [2025-03-04 00:37:39,877 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 10735 transitions. Word has length 514 [2025-03-04 00:37:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 6607 states and 10735 transitions. [2025-03-04 00:37:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 10735 transitions. [2025-03-04 00:37:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-04 00:37:39,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:39,883 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:39,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:39,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 167136611, now seen corresponding path program 1 times [2025-03-04 00:37:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001407252] [2025-03-04 00:37:39,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:39,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-04 00:37:39,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-04 00:37:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001407252] [2025-03-04 00:37:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001407252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:40,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904226469] [2025-03-04 00:37:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:40,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:40,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:40,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:40,242 INFO L87 Difference]: Start difference. First operand 6607 states and 10735 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:40,455 INFO L93 Difference]: Finished difference Result 10977 states and 17819 transitions. [2025-03-04 00:37:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 515 [2025-03-04 00:37:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:40,476 INFO L225 Difference]: With dead ends: 10977 [2025-03-04 00:37:40,477 INFO L226 Difference]: Without dead ends: 7865 [2025-03-04 00:37:40,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:40,483 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 390 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:40,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1360 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7865 states. [2025-03-04 00:37:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7865 to 7863. [2025-03-04 00:37:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7863 states, 6958 states have (on average 1.5799080195458466) internal successors, (10993), 6972 states have internal predecessors, (10993), 849 states have call successors, (849), 55 states have call predecessors, (849), 55 states have return successors, (849), 835 states have call predecessors, (849), 849 states have call successors, (849) [2025-03-04 00:37:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7863 states to 7863 states and 12691 transitions. [2025-03-04 00:37:40,751 INFO L78 Accepts]: Start accepts. Automaton has 7863 states and 12691 transitions. Word has length 515 [2025-03-04 00:37:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:40,751 INFO L471 AbstractCegarLoop]: Abstraction has 7863 states and 12691 transitions. [2025-03-04 00:37:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7863 states and 12691 transitions. [2025-03-04 00:37:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-04 00:37:40,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:40,756 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:37:40,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:40,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1049225082, now seen corresponding path program 1 times [2025-03-04 00:37:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906619933] [2025-03-04 00:37:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-04 00:37:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-04 00:37:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906619933] [2025-03-04 00:37:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906619933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:41,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:41,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219115934] [2025-03-04 00:37:41,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:41,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:41,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:41,337 INFO L87 Difference]: Start difference. First operand 7863 states and 12691 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:41,799 INFO L93 Difference]: Finished difference Result 17129 states and 27665 transitions. [2025-03-04 00:37:41,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 515 [2025-03-04 00:37:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:41,826 INFO L225 Difference]: With dead ends: 17129 [2025-03-04 00:37:41,826 INFO L226 Difference]: Without dead ends: 9578 [2025-03-04 00:37:41,837 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-04 00:37:41,838 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 615 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:41,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1685 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:37:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2025-03-04 00:37:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 4424. [2025-03-04 00:37:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 3793 states have (on average 1.5496968099129975) internal successors, (5878), 3797 states have internal predecessors, (5878), 583 states have call successors, (583), 47 states have call predecessors, (583), 47 states have return successors, (583), 579 states have call predecessors, (583), 583 states have call successors, (583) [2025-03-04 00:37:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 7044 transitions. [2025-03-04 00:37:42,151 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 7044 transitions. Word has length 515 [2025-03-04 00:37:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:42,152 INFO L471 AbstractCegarLoop]: Abstraction has 4424 states and 7044 transitions. [2025-03-04 00:37:42,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 7044 transitions. [2025-03-04 00:37:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:37:42,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:42,154 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:42,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:37:42,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:42,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1759487504, now seen corresponding path program 1 times [2025-03-04 00:37:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217204770] [2025-03-04 00:37:42,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:43,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:43,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 33 proven. 195 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217204770] [2025-03-04 00:37:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217204770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501982044] [2025-03-04 00:37:44,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:44,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:44,185 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-04 00:37:44,186 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-04 00:37:44,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:44,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:44,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:44,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:44,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:37:44,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5422 proven. 147 refuted. 0 times theorem prover too weak. 6135 trivial. 0 not checked. [2025-03-04 00:37:45,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 81 proven. 147 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501982044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:45,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2025-03-04 00:37:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136869828] [2025-03-04 00:37:45,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:45,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:37:45,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:45,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:37:45,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:37:45,757 INFO L87 Difference]: Start difference. First operand 4424 states and 7044 transitions. Second operand has 18 states, 18 states have (on average 19.11111111111111) internal successors, (344), 18 states have internal predecessors, (344), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) [2025-03-04 00:37:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:48,838 INFO L93 Difference]: Finished difference Result 22575 states and 35911 transitions. [2025-03-04 00:37:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 00:37:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.11111111111111) internal successors, (344), 18 states have internal predecessors, (344), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) Word has length 517 [2025-03-04 00:37:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:48,878 INFO L225 Difference]: With dead ends: 22575 [2025-03-04 00:37:48,879 INFO L226 Difference]: Without dead ends: 18360 [2025-03-04 00:37:48,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1036 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1821 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1045, Invalid=4067, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 00:37:48,891 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 3812 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 1094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3825 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1094 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:48,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3825 Valid, 2598 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1094 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:37:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18360 states. [2025-03-04 00:37:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18360 to 11140. [2025-03-04 00:37:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11140 states, 9338 states have (on average 1.5100663953737417) internal successors, (14101), 9344 states have internal predecessors, (14101), 1625 states have call successors, (1625), 176 states have call predecessors, (1625), 176 states have return successors, (1625), 1619 states have call predecessors, (1625), 1625 states have call successors, (1625) [2025-03-04 00:37:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17351 transitions. [2025-03-04 00:37:49,421 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17351 transitions. Word has length 517 [2025-03-04 00:37:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:49,422 INFO L471 AbstractCegarLoop]: Abstraction has 11140 states and 17351 transitions. [2025-03-04 00:37:49,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.11111111111111) internal successors, (344), 18 states have internal predecessors, (344), 6 states have call successors, (231), 3 states have call predecessors, (231), 6 states have return successors, (231), 6 states have call predecessors, (231), 6 states have call successors, (231) [2025-03-04 00:37:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17351 transitions. [2025-03-04 00:37:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:37:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:49,425 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:49,435 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-04 00:37:49,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:49,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:49,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1734720560, now seen corresponding path program 1 times [2025-03-04 00:37:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:49,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533656563] [2025-03-04 00:37:49,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:49,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:49,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:49,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533656563] [2025-03-04 00:37:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533656563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:37:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62541116] [2025-03-04 00:37:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:37:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:50,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:37:50,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:50,317 INFO L87 Difference]: Start difference. First operand 11140 states and 17351 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:51,130 INFO L93 Difference]: Finished difference Result 21910 states and 34143 transitions. [2025-03-04 00:37:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 517 [2025-03-04 00:37:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:51,161 INFO L225 Difference]: With dead ends: 21910 [2025-03-04 00:37:51,161 INFO L226 Difference]: Without dead ends: 11142 [2025-03-04 00:37:51,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:51,180 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 756 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:51,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 2491 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2025-03-04 00:37:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 11140. [2025-03-04 00:37:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11140 states, 9338 states have (on average 1.5081387877489827) internal successors, (14083), 9344 states have internal predecessors, (14083), 1625 states have call successors, (1625), 176 states have call predecessors, (1625), 176 states have return successors, (1625), 1619 states have call predecessors, (1625), 1625 states have call successors, (1625) [2025-03-04 00:37:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17333 transitions. [2025-03-04 00:37:51,723 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17333 transitions. Word has length 517 [2025-03-04 00:37:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:51,723 INFO L471 AbstractCegarLoop]: Abstraction has 11140 states and 17333 transitions. [2025-03-04 00:37:51,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:37:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17333 transitions. [2025-03-04 00:37:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:37:51,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:51,727 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:37:51,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -551373263, now seen corresponding path program 1 times [2025-03-04 00:37:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2857065] [2025-03-04 00:37:51,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:51,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:52,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:52,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:52,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:37:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2857065] [2025-03-04 00:37:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2857065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:52,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:52,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:37:52,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279135714] [2025-03-04 00:37:52,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:52,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:37:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:52,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:37:52,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:52,608 INFO L87 Difference]: Start difference. First operand 11140 states and 17333 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:53,496 INFO L93 Difference]: Finished difference Result 18896 states and 29479 transitions. [2025-03-04 00:37:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 517 [2025-03-04 00:37:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:53,531 INFO L225 Difference]: With dead ends: 18896 [2025-03-04 00:37:53,532 INFO L226 Difference]: Without dead ends: 11158 [2025-03-04 00:37:53,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:53,548 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 833 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:53,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1132 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11158 states. [2025-03-04 00:37:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11158 to 11156. [2025-03-04 00:37:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11156 states, 9354 states have (on average 1.5034209963651914) internal successors, (14063), 9360 states have internal predecessors, (14063), 1625 states have call successors, (1625), 176 states have call predecessors, (1625), 176 states have return successors, (1625), 1619 states have call predecessors, (1625), 1625 states have call successors, (1625) [2025-03-04 00:37:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11156 states to 11156 states and 17313 transitions. [2025-03-04 00:37:54,538 INFO L78 Accepts]: Start accepts. Automaton has 11156 states and 17313 transitions. Word has length 517 [2025-03-04 00:37:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 11156 states and 17313 transitions. [2025-03-04 00:37:54,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:37:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 11156 states and 17313 transitions. [2025-03-04 00:37:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:37:54,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:54,543 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:37:54,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:54,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1397538641, now seen corresponding path program 1 times [2025-03-04 00:37:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261930123] [2025-03-04 00:37:54,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:54,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:55,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:55,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:55,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 81 proven. 147 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261930123] [2025-03-04 00:37:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261930123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661577650] [2025-03-04 00:37:55,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:55,580 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-04 00:37:55,581 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-04 00:37:55,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:37:55,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:37:55,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:55,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:55,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:37:55,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 3276 proven. 36 refuted. 0 times theorem prover too weak. 8392 trivial. 0 not checked. [2025-03-04 00:37:56,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 192 proven. 36 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-03-04 00:37:56,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661577650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:56,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:56,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2025-03-04 00:37:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398167598] [2025-03-04 00:37:56,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:56,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:37:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:56,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:37:56,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:37:56,244 INFO L87 Difference]: Start difference. First operand 11156 states and 17313 transitions. Second operand has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 4 states have call successors, (166), 2 states have call predecessors, (166), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-03-04 00:37:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:57,393 INFO L93 Difference]: Finished difference Result 19433 states and 29641 transitions. [2025-03-04 00:37:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:37:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 4 states have call successors, (166), 2 states have call predecessors, (166), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) Word has length 517 [2025-03-04 00:37:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:57,416 INFO L225 Difference]: With dead ends: 19433 [2025-03-04 00:37:57,416 INFO L226 Difference]: Without dead ends: 8489 [2025-03-04 00:37:57,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1030 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:37:57,429 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1016 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:57,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 793 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:37:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8489 states. [2025-03-04 00:37:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8489 to 8237. [2025-03-04 00:37:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8237 states, 6404 states have (on average 1.4047470331043097) internal successors, (8996), 6410 states have internal predecessors, (8996), 1625 states have call successors, (1625), 207 states have call predecessors, (1625), 207 states have return successors, (1625), 1619 states have call predecessors, (1625), 1625 states have call successors, (1625) [2025-03-04 00:37:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 12246 transitions. [2025-03-04 00:37:57,977 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 12246 transitions. Word has length 517 [2025-03-04 00:37:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 8237 states and 12246 transitions. [2025-03-04 00:37:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 4 states have call successors, (166), 2 states have call predecessors, (166), 4 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-03-04 00:37:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 12246 transitions. [2025-03-04 00:37:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 00:37:57,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:57,980 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:57,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:37:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:37:58,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1358773632, now seen corresponding path program 1 times [2025-03-04 00:37:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527658081] [2025-03-04 00:37:58,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:58,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:37:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:37:58,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 126 proven. 750 refuted. 0 times theorem prover too weak. 10828 trivial. 0 not checked. [2025-03-04 00:38:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527658081] [2025-03-04 00:38:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527658081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569290147] [2025-03-04 00:38:02,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:02,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:02,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:02,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:38:02,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:38:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 00:38:02,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 00:38:02,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:02,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:02,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:38:02,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5056 proven. 540 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2025-03-04 00:38:04,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:38:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 96 proven. 357 refuted. 0 times theorem prover too weak. 11251 trivial. 0 not checked. [2025-03-04 00:38:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569290147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:38:04,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:38:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 9] total 35 [2025-03-04 00:38:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098240073] [2025-03-04 00:38:04,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:38:04,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 00:38:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:04,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 00:38:04,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:38:04,739 INFO L87 Difference]: Start difference. First operand 8237 states and 12246 transitions. Second operand has 35 states, 35 states have (on average 10.685714285714285) internal successors, (374), 34 states have internal predecessors, (374), 12 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (220), 12 states have call predecessors, (220), 12 states have call successors, (220) [2025-03-04 00:38:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:17,899 INFO L93 Difference]: Finished difference Result 60444 states and 90864 transitions. [2025-03-04 00:38:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-04 00:38:17,900 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 10.685714285714285) internal successors, (374), 34 states have internal predecessors, (374), 12 states have call successors, (219), 4 states have call predecessors, (219), 8 states have return successors, (220), 12 states have call predecessors, (220), 12 states have call successors, (220) Word has length 520 [2025-03-04 00:38:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:17,999 INFO L225 Difference]: With dead ends: 60444 [2025-03-04 00:38:17,999 INFO L226 Difference]: Without dead ends: 52522 [2025-03-04 00:38:18,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 1049 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5703 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3621, Invalid=13671, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 00:38:18,027 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 8468 mSDsluCounter, 4882 mSDsCounter, 0 mSdLazyCounter, 6129 mSolverCounterSat, 1062 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8480 SdHoareTripleChecker+Valid, 5246 SdHoareTripleChecker+Invalid, 7191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1062 IncrementalHoareTripleChecker+Valid, 6129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:18,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8480 Valid, 5246 Invalid, 7191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1062 Valid, 6129 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-04 00:38:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52522 states.