./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.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 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:43:35,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:43:35,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:43:35,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:43:35,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:43:35,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:43:35,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:43:35,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:43:35,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:43:35,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:43:35,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:43:35,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:43:35,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:43:35,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:43:35,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:43:35,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:43:35,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:43:35,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:43:35,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:43:35,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:43:35,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:43:35,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:43:35,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:35,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:43:35,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:43:35,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:43:35,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:43:35,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:43:35,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:43:35,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:43:35,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:43:35,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:43:35,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:43:35,784 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 -> 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 [2025-03-03 19:43:36,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:43:36,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:43:36,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:43:36,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:43:36,061 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:43:36,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-03 19:43:37,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6335ba525/ac6a0dedf5e84cb9a520e6eb265a9208/FLAG8284af431 [2025-03-03 19:43:37,579 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:43:37,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-03 19:43:37,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6335ba525/ac6a0dedf5e84cb9a520e6eb265a9208/FLAG8284af431 [2025-03-03 19:43:37,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6335ba525/ac6a0dedf5e84cb9a520e6eb265a9208 [2025-03-03 19:43:37,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:43:37,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:43:37,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:37,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:43:37,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:43:37,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:37,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37, skipping insertion in model container [2025-03-03 19:43:37,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:37,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:43:37,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-03-03 19:43:37,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:37,876 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:43:37,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-03-03 19:43:37,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:37,943 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:43:37,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37 WrapperNode [2025-03-03 19:43:37,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:37,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:37,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:43:37,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:43:37,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:37,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,011 INFO L138 Inliner]: procedures = 26, calls = 96, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-03-03 19:43:38,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:38,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:43:38,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:43:38,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:43:38,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,050 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:43:38,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:43:38,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:43:38,074 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:43:38,074 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:43:38,075 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (1/1) ... [2025-03-03 19:43:38,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:38,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:43:38,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:43:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:43:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:43:38,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:43:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:43:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:43:38,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:43:38,215 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:43:38,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:43:38,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: havoc property_#t~bitwise61#1; [2025-03-03 19:43:38,897 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 19:43:38,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:43:38,924 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:43:38,925 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:43:38,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:38 BoogieIcfgContainer [2025-03-03 19:43:38,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:43:38,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:43:38,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:43:38,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:43:38,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:43:37" (1/3) ... [2025-03-03 19:43:38,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072d199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:38, skipping insertion in model container [2025-03-03 19:43:38,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:37" (2/3) ... [2025-03-03 19:43:38,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072d199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:38, skipping insertion in model container [2025-03-03 19:43:38,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:38" (3/3) ... [2025-03-03 19:43:38,936 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-03 19:43:38,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:43:38,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:43:39,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:43:39,012 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;@422f2d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:43:39,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:43:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-03 19:43:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 19:43:39,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:39,035 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:39,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 641571268, now seen corresponding path program 1 times [2025-03-03 19:43:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566042168] [2025-03-03 19:43:39,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:39,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:43:39,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:43:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-03-03 19:43:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566042168] [2025-03-03 19:43:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566042168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690804964] [2025-03-03 19:43:39,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:39,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:39,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:39,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:39,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:43:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:43:39,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:43:39,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:39,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:39,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:43:39,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-03-03 19:43:39,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:43:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690804964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:39,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:43:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:43:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436561137] [2025-03-03 19:43:39,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:39,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:43:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:39,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:43:39,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:43:39,916 INFO L87 Difference]: Start difference. First operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-03 19:43:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:39,979 INFO L93 Difference]: Finished difference Result 473 states and 874 transitions. [2025-03-03 19:43:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:43:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) Word has length 525 [2025-03-03 19:43:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:39,989 INFO L225 Difference]: With dead ends: 473 [2025-03-03 19:43:39,990 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 19:43:39,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:43:39,998 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:40,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 19:43:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-03 19:43:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-03 19:43:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 390 transitions. [2025-03-03 19:43:40,066 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 390 transitions. Word has length 525 [2025-03-03 19:43:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:40,067 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 390 transitions. [2025-03-03 19:43:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-03 19:43:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 390 transitions. [2025-03-03 19:43:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 19:43:40,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:40,079 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:40,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:43:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:43:40,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1924140097, now seen corresponding path program 1 times [2025-03-03 19:43:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609341132] [2025-03-03 19:43:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:40,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 19:43:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 19:43:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609341132] [2025-03-03 19:43:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609341132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359098279] [2025-03-03 19:43:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:40,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:40,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:40,779 INFO L87 Difference]: Start difference. First operand 236 states and 390 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:40,894 INFO L93 Difference]: Finished difference Result 693 states and 1148 transitions. [2025-03-03 19:43:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 525 [2025-03-03 19:43:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:40,903 INFO L225 Difference]: With dead ends: 693 [2025-03-03 19:43:40,904 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 19:43:40,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:40,906 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 348 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:40,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 750 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:43:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 19:43:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2025-03-03 19:43:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 289 states have (on average 1.4567474048442905) internal successors, (421), 289 states have internal predecessors, (421), 166 states have call successors, (166), 2 states have call predecessors, (166), 2 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-03 19:43:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 753 transitions. [2025-03-03 19:43:40,981 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 753 transitions. Word has length 525 [2025-03-03 19:43:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 753 transitions. [2025-03-03 19:43:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 753 transitions. [2025-03-03 19:43:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:43:40,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:40,992 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:43:40,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:40,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1250744150, now seen corresponding path program 1 times [2025-03-03 19:43:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717454039] [2025-03-03 19:43:40,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:41,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:43:41,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:43:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:41,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717454039] [2025-03-03 19:43:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717454039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61539170] [2025-03-03 19:43:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:41,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:41,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:41,385 INFO L87 Difference]: Start difference. First operand 458 states and 753 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:41,456 INFO L93 Difference]: Finished difference Result 979 states and 1594 transitions. [2025-03-03 19:43:41,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:41,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-03 19:43:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:41,463 INFO L225 Difference]: With dead ends: 979 [2025-03-03 19:43:41,464 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 19:43:41,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:41,467 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 39 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:41,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 19:43:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2025-03-03 19:43:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 337 states have (on average 1.4332344213649852) internal successors, (483), 339 states have internal predecessors, (483), 178 states have call successors, (178), 4 states have call predecessors, (178), 4 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-03 19:43:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 839 transitions. [2025-03-03 19:43:41,524 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 839 transitions. Word has length 526 [2025-03-03 19:43:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:41,527 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 839 transitions. [2025-03-03 19:43:41,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 839 transitions. [2025-03-03 19:43:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:43:41,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:41,532 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:43:41,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 256807659, now seen corresponding path program 1 times [2025-03-03 19:43:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-03-03 19:43:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:41,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:43:41,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:43:41,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:41,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-03-03 19:43:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183114815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724889012] [2025-03-03 19:43:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:41,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:41,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:41,893 INFO L87 Difference]: Start difference. First operand 520 states and 839 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:41,986 INFO L93 Difference]: Finished difference Result 1553 states and 2510 transitions. [2025-03-03 19:43:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:41,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-03 19:43:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:41,995 INFO L225 Difference]: With dead ends: 1553 [2025-03-03 19:43:41,996 INFO L226 Difference]: Without dead ends: 1036 [2025-03-03 19:43:41,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:41,999 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 375 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:42,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1018 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-03 19:43:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1022. [2025-03-03 19:43:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 657 states have (on average 1.4292237442922375) internal successors, (939), 661 states have internal predecessors, (939), 356 states have call successors, (356), 8 states have call predecessors, (356), 8 states have return successors, (356), 352 states have call predecessors, (356), 356 states have call successors, (356) [2025-03-03 19:43:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1651 transitions. [2025-03-03 19:43:42,152 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1651 transitions. Word has length 526 [2025-03-03 19:43:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:42,152 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1651 transitions. [2025-03-03 19:43:42,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1651 transitions. [2025-03-03 19:43:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 19:43:42,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:42,156 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:42,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:43:42,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash -665875924, now seen corresponding path program 1 times [2025-03-03 19:43:42,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:42,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027587675] [2025-03-03 19:43:42,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:42,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 19:43:42,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 19:43:42,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027587675] [2025-03-03 19:43:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027587675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:42,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:43:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743795447] [2025-03-03 19:43:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:43:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:42,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:43:42,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:43:42,895 INFO L87 Difference]: Start difference. First operand 1022 states and 1651 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:43,683 INFO L93 Difference]: Finished difference Result 2486 states and 4028 transitions. [2025-03-03 19:43:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:43:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-03 19:43:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:43,695 INFO L225 Difference]: With dead ends: 2486 [2025-03-03 19:43:43,696 INFO L226 Difference]: Without dead ends: 1467 [2025-03-03 19:43:43,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:43:43,701 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 336 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:43,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1515 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:43:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-03 19:43:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1345. [2025-03-03 19:43:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 896 states have (on average 1.4776785714285714) internal successors, (1324), 900 states have internal predecessors, (1324), 439 states have call successors, (439), 9 states have call predecessors, (439), 9 states have return successors, (439), 435 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-03 19:43:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2202 transitions. [2025-03-03 19:43:43,855 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2202 transitions. Word has length 526 [2025-03-03 19:43:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:43,858 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2202 transitions. [2025-03-03 19:43:43,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2202 transitions. [2025-03-03 19:43:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:43:43,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:43,861 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:43,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:43:43,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:43,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1020444358, now seen corresponding path program 1 times [2025-03-03 19:43:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:43,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872869322] [2025-03-03 19:43:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:43,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:43,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:43,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:44,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872869322] [2025-03-03 19:43:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872869322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:44,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:44,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:43:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653936002] [2025-03-03 19:43:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:44,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:43:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:44,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:43:44,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:43:44,423 INFO L87 Difference]: Start difference. First operand 1345 states and 2202 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:44,880 INFO L93 Difference]: Finished difference Result 3851 states and 6251 transitions. [2025-03-03 19:43:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:43:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-03 19:43:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:44,899 INFO L225 Difference]: With dead ends: 3851 [2025-03-03 19:43:44,900 INFO L226 Difference]: Without dead ends: 2812 [2025-03-03 19:43:44,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:44,905 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 389 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:44,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 957 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:43:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-03 19:43:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2806. [2025-03-03 19:43:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 1904 states have (on average 1.474264705882353) internal successors, (2807), 1916 states have internal predecessors, (2807), 879 states have call successors, (879), 22 states have call predecessors, (879), 22 states have return successors, (879), 867 states have call predecessors, (879), 879 states have call successors, (879) [2025-03-03 19:43:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4565 transitions. [2025-03-03 19:43:45,131 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4565 transitions. Word has length 527 [2025-03-03 19:43:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:45,132 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4565 transitions. [2025-03-03 19:43:45,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4565 transitions. [2025-03-03 19:43:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:43:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:45,136 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:43:45,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1197313595, now seen corresponding path program 1 times [2025-03-03 19:43:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792146295] [2025-03-03 19:43:45,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:45,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:45,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:45,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:45,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792146295] [2025-03-03 19:43:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792146295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:45,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:45,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030796223] [2025-03-03 19:43:45,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:45,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:45,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:45,636 INFO L87 Difference]: Start difference. First operand 2806 states and 4565 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:46,195 INFO L93 Difference]: Finished difference Result 5742 states and 9184 transitions. [2025-03-03 19:43:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:43:46,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-03 19:43:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:46,214 INFO L225 Difference]: With dead ends: 5742 [2025-03-03 19:43:46,214 INFO L226 Difference]: Without dead ends: 3434 [2025-03-03 19:43:46,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:43:46,222 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 393 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:46,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1308 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:43:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-03-03 19:43:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 2854. [2025-03-03 19:43:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 1952 states have (on average 1.4707991803278688) internal successors, (2871), 1964 states have internal predecessors, (2871), 879 states have call successors, (879), 22 states have call predecessors, (879), 22 states have return successors, (879), 867 states have call predecessors, (879), 879 states have call successors, (879) [2025-03-03 19:43:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4629 transitions. [2025-03-03 19:43:46,471 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4629 transitions. Word has length 527 [2025-03-03 19:43:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:46,472 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4629 transitions. [2025-03-03 19:43:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4629 transitions. [2025-03-03 19:43:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:43:46,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:46,476 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:43:46,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:46,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash 903910588, now seen corresponding path program 1 times [2025-03-03 19:43:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:46,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134955452] [2025-03-03 19:43:46,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:46,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:46,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:46,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:46,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-03 19:43:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:47,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134955452] [2025-03-03 19:43:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134955452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:47,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:43:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927804738] [2025-03-03 19:43:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:47,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:43:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:47,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:43:47,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:43:47,070 INFO L87 Difference]: Start difference. First operand 2854 states and 4629 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:47,407 INFO L93 Difference]: Finished difference Result 7230 states and 11712 transitions. [2025-03-03 19:43:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:43:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-03 19:43:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:47,431 INFO L225 Difference]: With dead ends: 7230 [2025-03-03 19:43:47,431 INFO L226 Difference]: Without dead ends: 4553 [2025-03-03 19:43:47,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:43:47,440 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 389 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:47,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1191 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:43:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2025-03-03 19:43:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4394. [2025-03-03 19:43:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4394 states, 3191 states have (on average 1.4857411469758697) internal successors, (4741), 3223 states have internal predecessors, (4741), 1159 states have call successors, (1159), 43 states have call predecessors, (1159), 43 states have return successors, (1159), 1127 states have call predecessors, (1159), 1159 states have call successors, (1159) [2025-03-03 19:43:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 7059 transitions. [2025-03-03 19:43:47,763 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 7059 transitions. Word has length 527 [2025-03-03 19:43:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:47,764 INFO L471 AbstractCegarLoop]: Abstraction has 4394 states and 7059 transitions. [2025-03-03 19:43:47,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-03 19:43:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 7059 transitions. [2025-03-03 19:43:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:43:47,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:47,771 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:47,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:43:47,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:47,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -346443462, now seen corresponding path program 1 times [2025-03-03 19:43:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671382463] [2025-03-03 19:43:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:47,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:48,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:48,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 138 proven. 108 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-03 19:43:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671382463] [2025-03-03 19:43:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671382463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719054131] [2025-03-03 19:43:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:48,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:48,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:48,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:43:48,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:48,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:48,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:48,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:48,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:43:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6582 proven. 96 refuted. 0 times theorem prover too weak. 6934 trivial. 0 not checked. [2025-03-03 19:43:49,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-03 19:43:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719054131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:49,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-03 19:43:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756436651] [2025-03-03 19:43:49,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:43:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:49,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:43:49,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:43:49,487 INFO L87 Difference]: Start difference. First operand 4394 states and 7059 transitions. Second operand has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) [2025-03-03 19:43:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:50,366 INFO L93 Difference]: Finished difference Result 8771 states and 13982 transitions. [2025-03-03 19:43:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:43:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) Word has length 527 [2025-03-03 19:43:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:50,391 INFO L225 Difference]: With dead ends: 8771 [2025-03-03 19:43:50,391 INFO L226 Difference]: Without dead ends: 4552 [2025-03-03 19:43:50,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1049 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:43:50,404 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 580 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:50,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1047 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:43:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2025-03-03 19:43:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4466. [2025-03-03 19:43:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 3245 states have (on average 1.473035439137134) internal successors, (4780), 3277 states have internal predecessors, (4780), 1159 states have call successors, (1159), 61 states have call predecessors, (1159), 61 states have return successors, (1159), 1127 states have call predecessors, (1159), 1159 states have call successors, (1159) [2025-03-03 19:43:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7098 transitions. [2025-03-03 19:43:50,733 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7098 transitions. Word has length 527 [2025-03-03 19:43:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:50,733 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 7098 transitions. [2025-03-03 19:43:50,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) [2025-03-03 19:43:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7098 transitions. [2025-03-03 19:43:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 19:43:50,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:50,737 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:43:50,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:43:50,938 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,SelfDestructingSolverStorable8 [2025-03-03 19:43:50,938 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:50,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1115613477, now seen corresponding path program 1 times [2025-03-03 19:43:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048561367] [2025-03-03 19:43:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:50,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:51,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:51,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 270 proven. 216 refuted. 0 times theorem prover too weak. 13126 trivial. 0 not checked. [2025-03-03 19:43:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048561367] [2025-03-03 19:43:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048561367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118102226] [2025-03-03 19:43:52,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:52,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:43:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 19:43:52,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 19:43:52,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:52,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:52,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 19:43:52,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 9549 proven. 582 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2025-03-03 19:43:57,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:01,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118102226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:01,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:44:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2025-03-03 19:44:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492048731] [2025-03-03 19:44:01,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:01,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 19:44:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:01,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 19:44:01,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=1844, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 19:44:01,460 INFO L87 Difference]: Start difference. First operand 4466 states and 7098 transitions. Second operand has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) [2025-03-03 19:44:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:14,279 INFO L93 Difference]: Finished difference Result 38374 states and 59587 transitions. [2025-03-03 19:44:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-03 19:44:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) Word has length 527 [2025-03-03 19:44:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:14,392 INFO L225 Difference]: With dead ends: 38374 [2025-03-03 19:44:14,392 INFO L226 Difference]: Without dead ends: 34152 [2025-03-03 19:44:14,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10019 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6672, Invalid=21384, Unknown=0, NotChecked=0, Total=28056 [2025-03-03 19:44:14,419 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 9089 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 3896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9090 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 8409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3896 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:14,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9090 Valid, 3414 Invalid, 8409 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3896 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-03 19:44:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34152 states. [2025-03-03 19:44:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34152 to 26128. [2025-03-03 19:44:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26128 states, 19987 states have (on average 1.4676039425626657) internal successors, (29333), 20279 states have internal predecessors, (29333), 5723 states have call successors, (5723), 417 states have call predecessors, (5723), 417 states have return successors, (5723), 5431 states have call predecessors, (5723), 5723 states have call successors, (5723) [2025-03-03 19:44:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26128 states to 26128 states and 40779 transitions. [2025-03-03 19:44:16,621 INFO L78 Accepts]: Start accepts. Automaton has 26128 states and 40779 transitions. Word has length 527 [2025-03-03 19:44:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:16,622 INFO L471 AbstractCegarLoop]: Abstraction has 26128 states and 40779 transitions. [2025-03-03 19:44:16,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) [2025-03-03 19:44:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26128 states and 40779 transitions. [2025-03-03 19:44:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 19:44:16,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:16,631 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:16,640 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-03 19:44:16,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:16,836 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1804760976, now seen corresponding path program 1 times [2025-03-03 19:44:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:16,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189937881] [2025-03-03 19:44:16,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:16,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 19:44:17,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 19:44:17,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:17,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-03 19:44:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189937881] [2025-03-03 19:44:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189937881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807059283] [2025-03-03 19:44:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:17,578 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-03 19:44:17,579 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-03 19:44:17,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 19:44:17,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 19:44:17,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:17,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:17,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:44:17,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6616 proven. 186 refuted. 0 times theorem prover too weak. 6810 trivial. 0 not checked. [2025-03-03 19:44:18,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-03 19:44:18,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807059283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:44:18,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:44:18,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-03 19:44:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172530807] [2025-03-03 19:44:18,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:18,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:44:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:18,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:44:18,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:44:18,974 INFO L87 Difference]: Start difference. First operand 26128 states and 40779 transitions. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) [2025-03-03 19:44:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:21,097 INFO L93 Difference]: Finished difference Result 51063 states and 79231 transitions. [2025-03-03 19:44:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:44:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) Word has length 528 [2025-03-03 19:44:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:21,192 INFO L225 Difference]: With dead ends: 51063 [2025-03-03 19:44:21,192 INFO L226 Difference]: Without dead ends: 25706 [2025-03-03 19:44:21,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 1052 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2025-03-03 19:44:21,240 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 589 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:21,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 647 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:44:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2025-03-03 19:44:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25026. [2025-03-03 19:44:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 19162 states have (on average 1.459607556622482) internal successors, (27969), 19434 states have internal predecessors, (27969), 5443 states have call successors, (5443), 420 states have call predecessors, (5443), 420 states have return successors, (5443), 5171 states have call predecessors, (5443), 5443 states have call successors, (5443) [2025-03-03 19:44:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 38855 transitions. [2025-03-03 19:44:23,680 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 38855 transitions. Word has length 528 [2025-03-03 19:44:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:23,681 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 38855 transitions. [2025-03-03 19:44:23,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) [2025-03-03 19:44:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 38855 transitions. [2025-03-03 19:44:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 19:44:23,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:23,690 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:23,699 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-03 19:44:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:23,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:23,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1325259672, now seen corresponding path program 1 times [2025-03-03 19:44:23,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784504252] [2025-03-03 19:44:23,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:23,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 19:44:24,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 19:44:24,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:24,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 291 proven. 195 refuted. 0 times theorem prover too weak. 13126 trivial. 0 not checked. [2025-03-03 19:44:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784504252] [2025-03-03 19:44:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784504252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421883968] [2025-03-03 19:44:25,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:25,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:25,118 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-03 19:44:25,119 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-03 19:44:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 19:44:25,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 19:44:25,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:25,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:25,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 19:44:25,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 7829 proven. 582 refuted. 0 times theorem prover too weak. 5201 trivial. 0 not checked. [2025-03-03 19:44:28,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:44:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421883968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:29,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:44:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25] total 30 [2025-03-03 19:44:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115650725] [2025-03-03 19:44:29,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:44:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 19:44:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:29,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 19:44:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 19:44:29,339 INFO L87 Difference]: Start difference. First operand 25026 states and 38855 transitions. Second operand has 30 states, 30 states have (on average 6.4) internal successors, (192), 29 states have internal predecessors, (192), 9 states have call successors, (122), 7 states have call predecessors, (122), 10 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) [2025-03-03 19:44:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:49,212 INFO L93 Difference]: Finished difference Result 159191 states and 243619 transitions. [2025-03-03 19:44:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-03 19:44:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 29 states have internal predecessors, (192), 9 states have call successors, (122), 7 states have call predecessors, (122), 10 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) Word has length 529 [2025-03-03 19:44:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:49,684 INFO L225 Difference]: With dead ends: 159191 [2025-03-03 19:44:49,684 INFO L226 Difference]: Without dead ends: 134940 [2025-03-03 19:44:49,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7424 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4451, Invalid=17011, Unknown=0, NotChecked=0, Total=21462 [2025-03-03 19:44:49,767 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 7077 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 3343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7077 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 7161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3343 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:49,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7077 Valid, 3305 Invalid, 7161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3343 Valid, 3818 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 19:44:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134940 states.