./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 15:23:10,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:23:10,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:23:10,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:23:10,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:23:10,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:23:10,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:23:10,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:23:10,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:23:10,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:23:10,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:23:10,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:23:10,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:23:10,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:23:10,789 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:23:10,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:23:10,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:23:10,789 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:23:10,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:23:10,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:23:10,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:23:10,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:23:10,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:23:10,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:23:10,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:23:10,792 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-08 15:23:11,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:23:11,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:23:11,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:23:11,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:23:11,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:23:11,040 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-08 15:23:12,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604c1b5ac/ffe7fab4f90146ff9166d8ce8d72ca88/FLAGdcfa1b517 [2025-03-08 15:23:12,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:23:12,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-51.i [2025-03-08 15:23:12,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604c1b5ac/ffe7fab4f90146ff9166d8ce8d72ca88/FLAGdcfa1b517 [2025-03-08 15:23:12,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/604c1b5ac/ffe7fab4f90146ff9166d8ce8d72ca88 [2025-03-08 15:23:12,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:23:12,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:23:12,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:23:12,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:23:12,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:23:12,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:23:12" (1/1) ... [2025-03-08 15:23:12,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc4922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:12, skipping insertion in model container [2025-03-08 15:23:12,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:23:12" (1/1) ... [2025-03-08 15:23:12,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:23:12,952 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-08 15:23:13,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:23:13,125 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:23:13,134 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-08 15:23:13,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:23:13,197 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:23:13,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13 WrapperNode [2025-03-08 15:23:13,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:23:13,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:23:13,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:23:13,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:23:13,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,279 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2025-03-08 15:23:13,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:23:13,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:23:13,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:23:13,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:23:13,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,346 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-08 15:23:13,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:23:13,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:23:13,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:23:13,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:23:13,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (1/1) ... [2025-03-08 15:23:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:23:13,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:13,432 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-08 15:23:13,439 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-08 15:23:13,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:23:13,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:23:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:23:13,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:23:13,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:23:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:23:13,559 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:23:13,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:23:14,272 INFO L1307 $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-08 15:23:14,349 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2025-03-08 15:23:14,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:23:14,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:23:14,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:23:14,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:23:14 BoogieIcfgContainer [2025-03-08 15:23:14,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:23:14,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:23:14,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:23:14,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:23:14,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:23:12" (1/3) ... [2025-03-08 15:23:14,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b08fce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:23:14, skipping insertion in model container [2025-03-08 15:23:14,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:23:13" (2/3) ... [2025-03-08 15:23:14,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b08fce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:23:14, skipping insertion in model container [2025-03-08 15:23:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:23:14" (3/3) ... [2025-03-08 15:23:14,382 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-51.i [2025-03-08 15:23:14,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:23:14,395 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-08 15:23:14,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:23:14,475 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;@2f454086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:23:14,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:23:14,481 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-08 15:23:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-08 15:23:14,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:14,500 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-08 15:23:14,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -108076034, now seen corresponding path program 1 times [2025-03-08 15:23:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:14,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384503172] [2025-03-08 15:23:14,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-08 15:23:14,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-08 15:23:14,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:14,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:15,002 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-08 15:23:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384503172] [2025-03-08 15:23:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384503172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362977054] [2025-03-08 15:23:15,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:15,009 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-08 15:23:15,012 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-08 15:23:15,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-08 15:23:15,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-08 15:23:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:15,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:23:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:15,368 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-08 15:23:15,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:23:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362977054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:23:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:23:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126379807] [2025-03-08 15:23:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:23:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:15,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:23:15,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:23:15,401 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-08 15:23:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:15,461 INFO L93 Difference]: Finished difference Result 387 states and 698 transitions. [2025-03-08 15:23:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:23:15,464 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-08 15:23:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:15,470 INFO L225 Difference]: With dead ends: 387 [2025-03-08 15:23:15,472 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 15:23:15,476 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-08 15:23:15,478 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-08 15:23:15,479 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-08 15:23:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 15:23:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-08 15:23:15,534 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-08 15:23:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2025-03-08 15:23:15,545 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 420 [2025-03-08 15:23:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:15,546 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 310 transitions. [2025-03-08 15:23:15,546 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-08 15:23:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 310 transitions. [2025-03-08 15:23:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-08 15:23:15,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:15,556 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-08 15:23:15,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:23:15,761 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-08 15:23:15,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -722648511, now seen corresponding path program 1 times [2025-03-08 15:23:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783481595] [2025-03-08 15:23:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-08 15:23:15,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-08 15:23:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:15,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:16,158 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-08 15:23:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:16,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783481595] [2025-03-08 15:23:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783481595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:23:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991209715] [2025-03-08 15:23:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:16,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:23:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:16,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:23:16,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:23:16,163 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-08 15:23:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:16,271 INFO L93 Difference]: Finished difference Result 485 states and 774 transitions. [2025-03-08 15:23:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:23:16,274 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-08 15:23:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:16,279 INFO L225 Difference]: With dead ends: 485 [2025-03-08 15:23:16,280 INFO L226 Difference]: Without dead ends: 295 [2025-03-08 15:23:16,283 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-08 15:23:16,284 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-08 15:23:16,284 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-08 15:23:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-08 15:23:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2025-03-08 15:23:16,324 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-08 15:23:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 463 transitions. [2025-03-08 15:23:16,329 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 463 transitions. Word has length 420 [2025-03-08 15:23:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:16,331 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 463 transitions. [2025-03-08 15:23:16,332 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-08 15:23:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 463 transitions. [2025-03-08 15:23:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-08 15:23:16,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:16,339 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-08 15:23:16,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:23:16,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:16,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2121975320, now seen corresponding path program 1 times [2025-03-08 15:23:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662619141] [2025-03-08 15:23:16,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:16,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-08 15:23:16,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-08 15:23:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:19,276 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-08 15:23:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662619141] [2025-03-08 15:23:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662619141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:23:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898653105] [2025-03-08 15:23:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:19,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:23:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:19,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:23:19,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:23:19,282 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-08 15:23:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:22,041 INFO L93 Difference]: Finished difference Result 1424 states and 2218 transitions. [2025-03-08 15:23:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:23:22,041 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-08 15:23:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:22,049 INFO L225 Difference]: With dead ends: 1424 [2025-03-08 15:23:22,049 INFO L226 Difference]: Without dead ends: 1135 [2025-03-08 15:23:22,050 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-08 15:23:22,051 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:22,051 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.6s Time] [2025-03-08 15:23:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2025-03-08 15:23:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 903. [2025-03-08 15:23:22,143 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-08 15:23:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1419 transitions. [2025-03-08 15:23:22,150 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1419 transitions. Word has length 421 [2025-03-08 15:23:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1419 transitions. [2025-03-08 15:23:22,154 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-08 15:23:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1419 transitions. [2025-03-08 15:23:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-08 15:23:22,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:22,161 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-08 15:23:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:23:22,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1148298055, now seen corresponding path program 1 times [2025-03-08 15:23:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930136709] [2025-03-08 15:23:22,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:22,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-08 15:23:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-08 15:23:22,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:22,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:22,783 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-08 15:23:22,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:22,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930136709] [2025-03-08 15:23:22,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930136709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:23:22,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:23:22,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:23:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856301817] [2025-03-08 15:23:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:23:22,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:23:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:22,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:23:22,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:23:22,786 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-08 15:23:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:23,088 INFO L93 Difference]: Finished difference Result 3292 states and 5138 transitions. [2025-03-08 15:23:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:23:23,089 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-08 15:23:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:23,102 INFO L225 Difference]: With dead ends: 3292 [2025-03-08 15:23:23,102 INFO L226 Difference]: Without dead ends: 2392 [2025-03-08 15:23:23,106 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-08 15:23:23,106 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-08 15:23:23,107 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-08 15:23:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-08 15:23:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1914. [2025-03-08 15:23:23,240 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-08 15:23:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2991 transitions. [2025-03-08 15:23:23,253 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2991 transitions. Word has length 421 [2025-03-08 15:23:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:23,254 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2991 transitions. [2025-03-08 15:23:23,254 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-08 15:23:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2991 transitions. [2025-03-08 15:23:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-08 15:23:23,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:23,259 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-08 15:23:23,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:23:23,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1440911244, now seen corresponding path program 1 times [2025-03-08 15:23:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99726608] [2025-03-08 15:23:23,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:23,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:23,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:23,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:23,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:23,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:24,128 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-08 15:23:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99726608] [2025-03-08 15:23:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99726608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931934933] [2025-03-08 15:23:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:24,131 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-08 15:23:24,133 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-08 15:23:24,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:24,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:24,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:24,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:24,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:23:24,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:24,704 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-08 15:23:24,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:25,110 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-08 15:23:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931934933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:25,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:23:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778544938] [2025-03-08 15:23:25,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:23:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:25,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:23:25,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:23:25,114 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-08 15:23:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:25,529 INFO L93 Difference]: Finished difference Result 3873 states and 6023 transitions. [2025-03-08 15:23:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:23:25,530 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-08 15:23:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:25,541 INFO L225 Difference]: With dead ends: 3873 [2025-03-08 15:23:25,541 INFO L226 Difference]: Without dead ends: 1962 [2025-03-08 15:23:25,547 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-08 15:23:25,547 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-08 15:23:25,547 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-08 15:23:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-08 15:23:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1916. [2025-03-08 15:23:25,635 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-08 15:23:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2978 transitions. [2025-03-08 15:23:25,646 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2978 transitions. Word has length 422 [2025-03-08 15:23:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:25,646 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2978 transitions. [2025-03-08 15:23:25,647 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-08 15:23:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2978 transitions. [2025-03-08 15:23:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-08 15:23:25,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:25,650 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-08 15:23:25,659 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-08 15:23:25,855 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-08 15:23:25,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:25,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1429595117, now seen corresponding path program 1 times [2025-03-08 15:23:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116526460] [2025-03-08 15:23:25,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:25,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:26,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:26,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:26,824 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-08 15:23:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116526460] [2025-03-08 15:23:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116526460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377534858] [2025-03-08 15:23:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:26,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:26,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:26,829 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-08 15:23:26,831 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-08 15:23:26,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:27,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:27,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:27,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:27,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:23:27,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:28,733 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-08 15:23:28,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:29,188 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-08 15:23:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377534858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:29,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:29,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-08 15:23:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413502791] [2025-03-08 15:23:29,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:23:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:29,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:23:29,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:23:29,192 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-08 15:23:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:30,114 INFO L93 Difference]: Finished difference Result 3858 states and 5935 transitions. [2025-03-08 15:23:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:23:30,116 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-08 15:23:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:30,129 INFO L225 Difference]: With dead ends: 3858 [2025-03-08 15:23:30,129 INFO L226 Difference]: Without dead ends: 1695 [2025-03-08 15:23:30,134 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-08 15:23:30,136 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:30,137 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.7s Time] [2025-03-08 15:23:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-08 15:23:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1663. [2025-03-08 15:23:30,268 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-08 15:23:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2488 transitions. [2025-03-08 15:23:30,278 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2488 transitions. Word has length 422 [2025-03-08 15:23:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:30,279 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2488 transitions. [2025-03-08 15:23:30,279 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-08 15:23:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2488 transitions. [2025-03-08 15:23:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-08 15:23:30,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:30,282 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-08 15:23:30,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:23:30,483 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-08 15:23:30,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -394104643, now seen corresponding path program 1 times [2025-03-08 15:23:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573666217] [2025-03-08 15:23:30,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:30,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:30,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:30,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:31,253 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-08 15:23:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573666217] [2025-03-08 15:23:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573666217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620832748] [2025-03-08 15:23:31,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:31,256 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-08 15:23:31,258 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-08 15:23:31,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:31,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:31,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:31,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:31,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:23:31,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:32,154 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-08 15:23:32,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:32,613 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-08 15:23:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620832748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:32,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 19 [2025-03-08 15:23:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746715548] [2025-03-08 15:23:32,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:32,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:23:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:32,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:23:32,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:23:32,616 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-08 15:23:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:23:37,019 INFO L93 Difference]: Finished difference Result 12362 states and 18308 transitions. [2025-03-08 15:23:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-08 15:23:37,020 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-08 15:23:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:23:37,061 INFO L225 Difference]: With dead ends: 12362 [2025-03-08 15:23:37,061 INFO L226 Difference]: Without dead ends: 10702 [2025-03-08 15:23:37,070 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-08 15:23:37,071 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 2019 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:23:37,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 5017 Invalid, 4805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 15:23:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10702 states. [2025-03-08 15:23:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10702 to 6723. [2025-03-08 15:23:37,641 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-08 15:23:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 9972 transitions. [2025-03-08 15:23:37,667 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 9972 transitions. Word has length 422 [2025-03-08 15:23:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:23:37,668 INFO L471 AbstractCegarLoop]: Abstraction has 6723 states and 9972 transitions. [2025-03-08 15:23:37,668 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-08 15:23:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 9972 transitions. [2025-03-08 15:23:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-08 15:23:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:23:37,680 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-08 15:23:37,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:23:37,880 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-08 15:23:37,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:23:37,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:23:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 631387356, now seen corresponding path program 1 times [2025-03-08 15:23:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:23:37,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303221627] [2025-03-08 15:23:37,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:37,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:23:37,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:38,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:38,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:43,045 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-08 15:23:43,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:23:43,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303221627] [2025-03-08 15:23:43,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303221627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:43,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872224104] [2025-03-08 15:23:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:23:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:23:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:23:43,048 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-08 15:23:43,050 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-08 15:23:43,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-08 15:23:43,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-08 15:23:43,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:23:43,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:23:43,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:23:43,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:23:44,056 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-08 15:23:44,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:44,627 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-08 15:23:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872224104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:23:44,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:23:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 30 [2025-03-08 15:23:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812306394] [2025-03-08 15:23:44,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 15:23:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:44,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 15:23:44,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-08 15:23:44,630 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-08 15:24:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:13,954 INFO L93 Difference]: Finished difference Result 22650 states and 33024 transitions. [2025-03-08 15:24:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2025-03-08 15:24:13,956 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-08 15:24:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:14,046 INFO L225 Difference]: With dead ends: 22650 [2025-03-08 15:24:14,046 INFO L226 Difference]: Without dead ends: 16061 [2025-03-08 15:24:14,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1157 GetRequests, 874 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34976 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=9724, Invalid=70648, Unknown=0, NotChecked=0, Total=80372 [2025-03-08 15:24:14,072 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 6804 mSDsluCounter, 8013 mSDsCounter, 0 mSdLazyCounter, 14693 mSolverCounterSat, 2640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s 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, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:14,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6817 Valid, 9136 Invalid, 17333 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2640 Valid, 14693 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2025-03-08 15:24:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16061 states. [2025-03-08 15:24:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16061 to 9699. [2025-03-08 15:24:15,094 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-08 15:24:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9699 states to 9699 states and 14162 transitions. [2025-03-08 15:24:15,128 INFO L78 Accepts]: Start accepts. Automaton has 9699 states and 14162 transitions. Word has length 422 [2025-03-08 15:24:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:15,131 INFO L471 AbstractCegarLoop]: Abstraction has 9699 states and 14162 transitions. [2025-03-08 15:24:15,132 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-08 15:24:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 9699 states and 14162 transitions. [2025-03-08 15:24:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-08 15:24:15,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:15,153 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-08 15:24:15,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:15,353 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-08 15:24:15,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:15,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 864076583, now seen corresponding path program 1 times [2025-03-08 15:24:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432497643] [2025-03-08 15:24:15,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:15,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-08 15:24:16,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-08 15:24:16,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:17,577 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-08 15:24:17,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432497643] [2025-03-08 15:24:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432497643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513431742] [2025-03-08 15:24:17,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:17,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:17,580 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-08 15:24:17,581 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-08 15:24:17,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-08 15:24:17,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-08 15:24:17,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:17,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:17,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 15:24:17,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 3497 proven. 303 refuted. 0 times theorem prover too weak. 5044 trivial. 0 not checked. [2025-03-08 15:24:19,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:23,706 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-08 15:24:23,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513431742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:23,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 20 [2025-03-08 15:24:23,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172484331] [2025-03-08 15:24:23,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:23,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:24:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:23,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:24:23,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:24:23,708 INFO L87 Difference]: Start difference. First operand 9699 states and 14162 transitions. Second operand has 20 states, 20 states have (on average 11.5) internal successors, (230), 20 states have internal predecessors, (230), 4 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 4 states have call predecessors, (174), 4 states have call successors, (174) [2025-03-08 15:24:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:26,628 INFO L93 Difference]: Finished difference Result 26774 states and 38436 transitions. [2025-03-08 15:24:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:24:26,630 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.5) internal successors, (230), 20 states have internal predecessors, (230), 4 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 4 states have call predecessors, (174), 4 states have call successors, (174) Word has length 423 [2025-03-08 15:24:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:26,679 INFO L225 Difference]: With dead ends: 26774 [2025-03-08 15:24:26,679 INFO L226 Difference]: Without dead ends: 17191 [2025-03-08 15:24:26,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 15:24:26,696 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 572 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:26,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1357 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:24:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2025-03-08 15:24:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 11111. [2025-03-08 15:24:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11111 states, 8526 states have (on average 1.3429509734928453) internal successors, (11450), 8647 states have internal predecessors, (11450), 2248 states have call successors, (2248), 336 states have call predecessors, (2248), 336 states have return successors, (2248), 2127 states have call predecessors, (2248), 2248 states have call successors, (2248) [2025-03-08 15:24:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11111 states to 11111 states and 15946 transitions. [2025-03-08 15:24:27,770 INFO L78 Accepts]: Start accepts. Automaton has 11111 states and 15946 transitions. Word has length 423 [2025-03-08 15:24:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:27,771 INFO L471 AbstractCegarLoop]: Abstraction has 11111 states and 15946 transitions. [2025-03-08 15:24:27,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.5) internal successors, (230), 20 states have internal predecessors, (230), 4 states have call successors, (173), 3 states have call predecessors, (173), 6 states have return successors, (174), 4 states have call predecessors, (174), 4 states have call successors, (174) [2025-03-08 15:24:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 11111 states and 15946 transitions. [2025-03-08 15:24:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-08 15:24:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:27,779 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, 1] [2025-03-08 15:24:27,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 15:24:27,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:27,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:27,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2085894995, now seen corresponding path program 1 times [2025-03-08 15:24:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494330704] [2025-03-08 15:24:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:27,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-08 15:24:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-08 15:24:28,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:28,653 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-08 15:24:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494330704] [2025-03-08 15:24:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494330704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778929563] [2025-03-08 15:24:28,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:28,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:28,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process