./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.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 71fa1ece88cae2f03b972f802d0e538a87174ef11cefc651662c60c0e9dd54e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:12:02,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:12:02,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:12:02,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:12:02,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:12:02,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:12:02,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:12:02,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:12:02,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:12:02,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:12:02,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:12:02,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:12:02,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:12:02,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:12:02,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:12:02,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:12:02,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:12:02,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:12:02,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:12:02,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:12:02,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:12:02,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:12:02,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:12:02,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:02,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:12:02,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:12:02,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:12:02,354 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 -> 71fa1ece88cae2f03b972f802d0e538a87174ef11cefc651662c60c0e9dd54e7 [2025-03-04 00:12:02,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:12:02,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:12:02,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:12:02,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:12:02,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:12:02,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i [2025-03-04 00:12:03,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc97eef/7c89f4f27f3842c4b051554c6f94b77a/FLAG9cf7c461f [2025-03-04 00:12:04,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:12:04,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i [2025-03-04 00:12:04,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc97eef/7c89f4f27f3842c4b051554c6f94b77a/FLAG9cf7c461f [2025-03-04 00:12:04,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc97eef/7c89f4f27f3842c4b051554c6f94b77a [2025-03-04 00:12:04,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:12:04,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:12:04,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:04,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:12:04,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:12:04,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c0674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04, skipping insertion in model container [2025-03-04 00:12:04,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:12:04,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i[916,929] [2025-03-04 00:12:04,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:04,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:12:04,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i[916,929] [2025-03-04 00:12:04,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:04,762 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:12:04,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04 WrapperNode [2025-03-04 00:12:04,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:04,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:04,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:12:04,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:12:04,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,841 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2025-03-04 00:12:04,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:04,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:12:04,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:12:04,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:12:04,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,911 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:12:04,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:12:04,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:12:04,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:12:04,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:12:04,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (1/1) ... [2025-03-04 00:12:04,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:04,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:05,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:12:05,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:12:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:12:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:12:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:12:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:12:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:12:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:12:05,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:12:05,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:12:05,779 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1; [2025-03-04 00:12:05,852 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-04 00:12:05,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:12:05,872 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:12:05,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:12:05,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:05 BoogieIcfgContainer [2025-03-04 00:12:05,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:12:05,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:12:05,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:12:05,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:12:05,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:12:04" (1/3) ... [2025-03-04 00:12:05,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396efc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:05, skipping insertion in model container [2025-03-04 00:12:05,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:04" (2/3) ... [2025-03-04 00:12:05,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396efc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:05, skipping insertion in model container [2025-03-04 00:12:05,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:05" (3/3) ... [2025-03-04 00:12:05,882 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-51.i [2025-03-04 00:12:05,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:12:05,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-51.i that has 2 procedures, 197 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:12:05,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:12:05,980 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;@143ad300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:12:05,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:12:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:12:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-04 00:12:06,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:06,007 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:06,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:06,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash -108076034, now seen corresponding path program 1 times [2025-03-04 00:12:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:06,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029651857] [2025-03-04 00:12:06,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:06,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-04 00:12:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-04 00:12:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:12:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029651857] [2025-03-04 00:12:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029651857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003820212] [2025-03-04 00:12:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:06,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:06,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:06,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:12:06,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-04 00:12:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-04 00:12:06,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:06,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:06,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:12:06,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:12:06,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:12:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003820212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:12:06,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:12:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980216219] [2025-03-04 00:12:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:12:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:12:06,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:06,873 INFO L87 Difference]: Start difference. First operand has 197 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:12:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:06,928 INFO L93 Difference]: Finished difference Result 387 states and 698 transitions. [2025-03-04 00:12:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:12:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 420 [2025-03-04 00:12:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:06,939 INFO L225 Difference]: With dead ends: 387 [2025-03-04 00:12:06,939 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 00:12:06,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 421 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-04 00:12:06,946 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:06,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 00:12:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 00:12:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:12:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2025-03-04 00:12:07,004 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 420 [2025-03-04 00:12:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:07,005 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 310 transitions. [2025-03-04 00:12:07,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:12:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 310 transitions. [2025-03-04 00:12:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-04 00:12:07,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:07,012 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:07,020 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-04 00:12:07,216 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-04 00:12:07,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:07,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash -722648511, now seen corresponding path program 1 times [2025-03-04 00:12:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319293300] [2025-03-04 00:12:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:07,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-04 00:12:07,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-04 00:12:07,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:07,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:12:07,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:07,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319293300] [2025-03-04 00:12:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319293300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:07,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694952904] [2025-03-04 00:12:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:07,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:07,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:07,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:07,612 INFO L87 Difference]: Start difference. First operand 193 states and 310 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:12:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:07,757 INFO L93 Difference]: Finished difference Result 485 states and 774 transitions. [2025-03-04 00:12:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 420 [2025-03-04 00:12:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:07,768 INFO L225 Difference]: With dead ends: 485 [2025-03-04 00:12:07,770 INFO L226 Difference]: Without dead ends: 295 [2025-03-04 00:12:07,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:07,775 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 153 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:07,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-04 00:12:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2025-03-04 00:12:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 197 states have (on average 1.416243654822335) internal successors, (279), 198 states have internal predecessors, (279), 92 states have call successors, (92), 2 states have call predecessors, (92), 2 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:12:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 463 transitions. [2025-03-04 00:12:07,829 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 463 transitions. Word has length 420 [2025-03-04 00:12:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:07,831 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 463 transitions. [2025-03-04 00:12:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:12:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 463 transitions. [2025-03-04 00:12:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-04 00:12:07,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:07,840 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:07,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:12:07,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2121975320, now seen corresponding path program 1 times [2025-03-04 00:12:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896455716] [2025-03-04 00:12:07,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:07,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-04 00:12:08,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-04 00:12:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:12:10,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896455716] [2025-03-04 00:12:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896455716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:12:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065165563] [2025-03-04 00:12:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:12:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:12:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:12:10,977 INFO L87 Difference]: Start difference. First operand 292 states and 463 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:12:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:13,712 INFO L93 Difference]: Finished difference Result 1424 states and 2218 transitions. [2025-03-04 00:12:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:12:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 421 [2025-03-04 00:12:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:13,723 INFO L225 Difference]: With dead ends: 1424 [2025-03-04 00:12:13,723 INFO L226 Difference]: Without dead ends: 1135 [2025-03-04 00:12:13,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:12:13,725 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 751 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:13,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2267 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:12:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-04 00:12:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 903. [2025-03-04 00:12:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 662 states have (on average 1.4425981873111782) internal successors, (955), 668 states have internal predecessors, (955), 232 states have call successors, (232), 8 states have call predecessors, (232), 8 states have return successors, (232), 226 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-04 00:12:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1419 transitions. [2025-03-04 00:12:13,827 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1419 transitions. Word has length 421 [2025-03-04 00:12:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1419 transitions. [2025-03-04 00:12:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:12:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1419 transitions. [2025-03-04 00:12:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-04 00:12:13,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:13,837 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:13,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:12:13,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:13,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1148298055, now seen corresponding path program 1 times [2025-03-04 00:12:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:13,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416671326] [2025-03-04 00:12:13,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:13,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-04 00:12:14,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-04 00:12:14,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:14,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:12:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416671326] [2025-03-04 00:12:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416671326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:12:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917820509] [2025-03-04 00:12:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:12:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:14,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:12:14,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:12:14,509 INFO L87 Difference]: Start difference. First operand 903 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:12:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:14,806 INFO L93 Difference]: Finished difference Result 3292 states and 5138 transitions. [2025-03-04 00:12:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:12:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 421 [2025-03-04 00:12:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:14,819 INFO L225 Difference]: With dead ends: 3292 [2025-03-04 00:12:14,820 INFO L226 Difference]: Without dead ends: 2392 [2025-03-04 00:12:14,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:12:14,823 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 341 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:14,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 865 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:12:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-04 00:12:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1914. [2025-03-04 00:12:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1509 states have (on average 1.4678595096090126) internal successors, (2215), 1523 states have internal predecessors, (2215), 388 states have call successors, (388), 16 states have call predecessors, (388), 16 states have return successors, (388), 374 states have call predecessors, (388), 388 states have call successors, (388) [2025-03-04 00:12:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2991 transitions. [2025-03-04 00:12:14,990 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2991 transitions. Word has length 421 [2025-03-04 00:12:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:14,990 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2991 transitions. [2025-03-04 00:12:14,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:12:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2991 transitions. [2025-03-04 00:12:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:12:14,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:14,995 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:14,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:12:14,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1440911244, now seen corresponding path program 1 times [2025-03-04 00:12:14,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:14,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805190826] [2025-03-04 00:12:14,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:15,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:15,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805190826] [2025-03-04 00:12:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805190826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520664976] [2025-03-04 00:12:15,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:15,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:15,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:15,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:12:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:16,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:16,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:16,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:16,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4378 proven. 114 refuted. 0 times theorem prover too weak. 4352 trivial. 0 not checked. [2025-03-04 00:12:16,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:16,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520664976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:16,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:16,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:12:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125422369] [2025-03-04 00:12:16,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:12:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:16,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:12:16,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:12:16,805 INFO L87 Difference]: Start difference. First operand 1914 states and 2991 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 2 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-04 00:12:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:17,241 INFO L93 Difference]: Finished difference Result 3873 states and 6023 transitions. [2025-03-04 00:12:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:12:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 2 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 422 [2025-03-04 00:12:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:17,253 INFO L225 Difference]: With dead ends: 3873 [2025-03-04 00:12:17,253 INFO L226 Difference]: Without dead ends: 1962 [2025-03-04 00:12:17,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 841 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:12:17,261 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 295 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:17,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 556 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-04 00:12:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1916. [2025-03-04 00:12:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1513 states have (on average 1.4606741573033708) internal successors, (2210), 1527 states have internal predecessors, (2210), 384 states have call successors, (384), 18 states have call predecessors, (384), 18 states have return successors, (384), 370 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-04 00:12:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2978 transitions. [2025-03-04 00:12:17,392 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2978 transitions. Word has length 422 [2025-03-04 00:12:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:17,393 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2978 transitions. [2025-03-04 00:12:17,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 2 states have call successors, (105), 2 states have call predecessors, (105), 4 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-04 00:12:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2978 transitions. [2025-03-04 00:12:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:12:17,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:17,397 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:17,405 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-04 00:12:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:17,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1429595117, now seen corresponding path program 1 times [2025-03-04 00:12:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195597406] [2025-03-04 00:12:17,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:17,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:18,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:18,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:18,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 90 proven. 108 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195597406] [2025-03-04 00:12:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195597406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538821840] [2025-03-04 00:12:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:18,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:18,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:12:18,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:18,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:18,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:18,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:18,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:12:18,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3057 proven. 159 refuted. 0 times theorem prover too weak. 5628 trivial. 0 not checked. [2025-03-04 00:12:20,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538821840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:20,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-04 00:12:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840931526] [2025-03-04 00:12:20,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:12:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:20,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:12:20,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:12:20,705 INFO L87 Difference]: Start difference. First operand 1916 states and 2978 transitions. Second operand has 18 states, 18 states have (on average 11.777777777777779) internal successors, (212), 18 states have internal predecessors, (212), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) [2025-03-04 00:12:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:21,600 INFO L93 Difference]: Finished difference Result 3858 states and 5935 transitions. [2025-03-04 00:12:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:12:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.777777777777779) internal successors, (212), 18 states have internal predecessors, (212), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) Word has length 422 [2025-03-04 00:12:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:21,611 INFO L225 Difference]: With dead ends: 3858 [2025-03-04 00:12:21,611 INFO L226 Difference]: Without dead ends: 1695 [2025-03-04 00:12:21,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:12:21,617 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 643 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:21,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 778 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:12:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-04 00:12:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1663. [2025-03-04 00:12:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1250 states have (on average 1.376) internal successors, (1720), 1264 states have internal predecessors, (1720), 384 states have call successors, (384), 28 states have call predecessors, (384), 28 states have return successors, (384), 370 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-04 00:12:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2488 transitions. [2025-03-04 00:12:21,749 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2488 transitions. Word has length 422 [2025-03-04 00:12:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:21,750 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2488 transitions. [2025-03-04 00:12:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.777777777777779) internal successors, (212), 18 states have internal predecessors, (212), 8 states have call successors, (187), 4 states have call predecessors, (187), 7 states have return successors, (187), 8 states have call predecessors, (187), 8 states have call successors, (187) [2025-03-04 00:12:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2488 transitions. [2025-03-04 00:12:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:12:21,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:21,754 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:21,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:21,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:21,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash -394104643, now seen corresponding path program 1 times [2025-03-04 00:12:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997866092] [2025-03-04 00:12:21,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:21,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:22,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:22,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:22,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 147 proven. 51 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997866092] [2025-03-04 00:12:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997866092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264459625] [2025-03-04 00:12:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:22,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:22,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:12:22,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:22,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:22,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:22,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:22,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:12:22,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3496 proven. 51 refuted. 0 times theorem prover too weak. 5297 trivial. 0 not checked. [2025-03-04 00:12:23,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 147 proven. 51 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264459625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:24,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:24,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 19 [2025-03-04 00:12:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464980861] [2025-03-04 00:12:24,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:24,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:12:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:24,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:12:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:12:24,055 INFO L87 Difference]: Start difference. First operand 1663 states and 2488 transitions. Second operand has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 5 states have call successors, (151), 3 states have call predecessors, (151), 6 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) [2025-03-04 00:12:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:28,765 INFO L93 Difference]: Finished difference Result 12362 states and 18308 transitions. [2025-03-04 00:12:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 00:12:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 5 states have call successors, (151), 3 states have call predecessors, (151), 6 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) Word has length 422 [2025-03-04 00:12:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:28,810 INFO L225 Difference]: With dead ends: 12362 [2025-03-04 00:12:28,810 INFO L226 Difference]: Without dead ends: 10702 [2025-03-04 00:12:28,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 842 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1415, Invalid=5391, Unknown=0, NotChecked=0, Total=6806 [2025-03-04 00:12:28,822 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 2019 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 4805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:28,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 5017 Invalid, 4805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:12:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10702 states. [2025-03-04 00:12:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10702 to 6723. [2025-03-04 00:12:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6723 states, 4984 states have (on average 1.3575441412520064) internal successors, (6766), 5045 states have internal predecessors, (6766), 1603 states have call successors, (1603), 135 states have call predecessors, (1603), 135 states have return successors, (1603), 1542 states have call predecessors, (1603), 1603 states have call successors, (1603) [2025-03-04 00:12:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 9972 transitions. [2025-03-04 00:12:29,427 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 9972 transitions. Word has length 422 [2025-03-04 00:12:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 6723 states and 9972 transitions. [2025-03-04 00:12:29,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.0) internal successors, (190), 19 states have internal predecessors, (190), 5 states have call successors, (151), 3 states have call predecessors, (151), 6 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) [2025-03-04 00:12:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 9972 transitions. [2025-03-04 00:12:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:12:29,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:29,439 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:29,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:12:29,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:29,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash 631387356, now seen corresponding path program 1 times [2025-03-04 00:12:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480949893] [2025-03-04 00:12:29,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:29,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:12:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480949893] [2025-03-04 00:12:35,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480949893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:35,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716230904] [2025-03-04 00:12:35,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:35,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:35,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:35,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:12:35,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:12:35,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:12:35,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:35,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:35,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:12:35,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3577 proven. 93 refuted. 0 times theorem prover too weak. 5174 trivial. 0 not checked. [2025-03-04 00:12:36,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 297 proven. 96 refuted. 0 times theorem prover too weak. 8451 trivial. 0 not checked. [2025-03-04 00:12:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716230904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:37,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-03-04 00:12:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684017491] [2025-03-04 00:12:37,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 00:12:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 00:12:37,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:12:37,180 INFO L87 Difference]: Start difference. First operand 6723 states and 9972 transitions. Second operand has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 30 states have internal predecessors, (238), 8 states have call successors, (194), 4 states have call predecessors, (194), 9 states have return successors, (194), 8 states have call predecessors, (194), 8 states have call successors, (194) [2025-03-04 00:13:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:10,263 INFO L93 Difference]: Finished difference Result 22650 states and 33024 transitions. [2025-03-04 00:13:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2025-03-04 00:13:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 30 states have internal predecessors, (238), 8 states have call successors, (194), 4 states have call predecessors, (194), 9 states have return successors, (194), 8 states have call predecessors, (194), 8 states have call successors, (194) Word has length 422 [2025-03-04 00:13:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:10,351 INFO L225 Difference]: With dead ends: 22650 [2025-03-04 00:13:10,351 INFO L226 Difference]: Without dead ends: 16061 [2025-03-04 00:13:10,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1157 GetRequests, 874 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34976 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=9724, Invalid=70648, Unknown=0, NotChecked=0, Total=80372 [2025-03-04 00:13:10,383 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 6804 mSDsluCounter, 8013 mSDsCounter, 0 mSdLazyCounter, 14693 mSolverCounterSat, 2640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6817 SdHoareTripleChecker+Valid, 9136 SdHoareTripleChecker+Invalid, 17333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2640 IncrementalHoareTripleChecker+Valid, 14693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:10,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6817 Valid, 9136 Invalid, 17333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2640 Valid, 14693 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2025-03-04 00:13:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16061 states. [2025-03-04 00:13:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16061 to 9699. [2025-03-04 00:13:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9699 states, 7542 states have (on average 1.3670114028109255) internal successors, (10310), 7637 states have internal predecessors, (10310), 1926 states have call successors, (1926), 230 states have call predecessors, (1926), 230 states have return successors, (1926), 1831 states have call predecessors, (1926), 1926 states have call successors, (1926) [2025-03-04 00:13:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9699 states to 9699 states and 14162 transitions. [2025-03-04 00:13:11,509 INFO L78 Accepts]: Start accepts. Automaton has 9699 states and 14162 transitions. Word has length 422 [2025-03-04 00:13:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 9699 states and 14162 transitions. [2025-03-04 00:13:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 30 states have internal predecessors, (238), 8 states have call successors, (194), 4 states have call predecessors, (194), 9 states have return successors, (194), 8 states have call predecessors, (194), 8 states have call successors, (194) [2025-03-04 00:13:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 9699 states and 14162 transitions. [2025-03-04 00:13:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:13:11,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:11,532 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:11,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:13:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:11,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:11,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 864076583, now seen corresponding path program 1 times [2025-03-04 00:13:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:11,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766216483] [2025-03-04 00:13:11,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:11,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:13:13,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:13:13,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 39 proven. 159 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-04 00:13:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766216483] [2025-03-04 00:13:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766216483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:15,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561344841] [2025-03-04 00:13:15,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:15,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:15,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:15,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:15,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:13:15,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:13:16,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:13:16,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:16,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:16,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:13:16,039 INFO L279 TraceCheckSpWp]: Computing forward predicates...