./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-4.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_fillercode_fillercodesize_ps-cn-100_file-4.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 0f4602ec66e4e7512b3b4973c06cedc84ad304a5485be80022aa82b19c491015 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:35:38,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:35:38,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:35:38,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:35:38,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:35:38,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:35:38,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:35:38,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:35:38,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:35:38,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:35:38,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:35:38,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:35:38,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:35:38,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:35:38,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:35:38,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:35:38,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:35:38,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:35:38,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:35:38,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:35:38,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:35:38,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:35:38,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:35:38,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:35:38,642 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 -> 0f4602ec66e4e7512b3b4973c06cedc84ad304a5485be80022aa82b19c491015 [2025-03-08 10:35:38,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:35:38,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:35:38,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:35:38,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:35:38,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:35:38,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-4.i [2025-03-08 10:35:40,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfebe98b5/eef4f4373b0349caa3f182bae1caa99a/FLAGc6e47b7c4 [2025-03-08 10:35:40,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:35:40,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-4.i [2025-03-08 10:35:40,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfebe98b5/eef4f4373b0349caa3f182bae1caa99a/FLAGc6e47b7c4 [2025-03-08 10:35:40,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfebe98b5/eef4f4373b0349caa3f182bae1caa99a [2025-03-08 10:35:40,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:35:40,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:35:40,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:35:40,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:35:40,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:35:40,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5713e4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40, skipping insertion in model container [2025-03-08 10:35:40,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:35:40,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-4.i[915,928] [2025-03-08 10:35:40,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:35:40,594 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:35:40,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-4.i[915,928] [2025-03-08 10:35:40,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:35:40,665 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:35:40,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40 WrapperNode [2025-03-08 10:35:40,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:35:40,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:35:40,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:35:40,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:35:40,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,723 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2025-03-08 10:35:40,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:35:40,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:35:40,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:35:40,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:35:40,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,758 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 10:35:40,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:35:40,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:35:40,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:35:40,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:35:40,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (1/1) ... [2025-03-08 10:35:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:35:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:35:40,816 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 10:35:40,819 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 10:35:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:35:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:35:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:35:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:35:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:35:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:35:40,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:35:40,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:35:41,420 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 10:35:41,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:35:41,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:35:41,441 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:35:41,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:35:41 BoogieIcfgContainer [2025-03-08 10:35:41,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:35:41,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:35:41,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:35:41,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:35:41,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:35:40" (1/3) ... [2025-03-08 10:35:41,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7150d212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:35:41, skipping insertion in model container [2025-03-08 10:35:41,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:35:40" (2/3) ... [2025-03-08 10:35:41,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7150d212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:35:41, skipping insertion in model container [2025-03-08 10:35:41,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:35:41" (3/3) ... [2025-03-08 10:35:41,466 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-4.i [2025-03-08 10:35:41,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:35:41,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-4.i that has 2 procedures, 179 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:35:41,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:35:41,539 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;@a4814c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:35:41,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:35:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 10:35:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-08 10:35:41,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:41,563 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:41,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:41,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 244706391, now seen corresponding path program 1 times [2025-03-08 10:35:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:41,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092764547] [2025-03-08 10:35:41,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:41,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 10:35:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 10:35:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 10:35:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092764547] [2025-03-08 10:35:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092764547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:35:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010029092] [2025-03-08 10:35:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:42,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:35:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:35:42,027 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 10:35:42,029 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 10:35:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-08 10:35:42,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-08 10:35:42,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:42,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:35:42,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:35:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-08 10:35:42,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:35:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010029092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:35:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:35:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:35:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402214998] [2025-03-08 10:35:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:35:42,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:35:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:35:42,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:35:42,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:35:42,362 INFO L87 Difference]: Start difference. First operand has 179 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 10:35:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:35:42,415 INFO L93 Difference]: Finished difference Result 352 states and 655 transitions. [2025-03-08 10:35:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:35:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 443 [2025-03-08 10:35:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:35:42,423 INFO L225 Difference]: With dead ends: 352 [2025-03-08 10:35:42,423 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 10:35:42,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 444 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 10:35:42,428 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:35:42,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:35:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 10:35:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-08 10:35:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 10:35:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 287 transitions. [2025-03-08 10:35:42,469 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 287 transitions. Word has length 443 [2025-03-08 10:35:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:35:42,470 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 287 transitions. [2025-03-08 10:35:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 10:35:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 287 transitions. [2025-03-08 10:35:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:35:42,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:42,476 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:42,483 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 10:35:42,676 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 10:35:42,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:42,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1034276296, now seen corresponding path program 1 times [2025-03-08 10:35:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154699259] [2025-03-08 10:35:42,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:35:42,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:35:42,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:42,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:35:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154699259] [2025-03-08 10:35:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154699259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:35:44,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:35:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:35:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346954381] [2025-03-08 10:35:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:35:44,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:35:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:35:44,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:35:44,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:35:44,125 INFO L87 Difference]: Start difference. First operand 176 states and 287 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:35:44,757 INFO L93 Difference]: Finished difference Result 549 states and 888 transitions. [2025-03-08 10:35:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:35:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 444 [2025-03-08 10:35:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:35:44,775 INFO L225 Difference]: With dead ends: 549 [2025-03-08 10:35:44,776 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 10:35:44,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:35:44,781 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 316 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:35:44,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1564 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:35:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 10:35:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 351. [2025-03-08 10:35:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 200 states have (on average 1.39) internal successors, (278), 200 states have internal predecessors, (278), 148 states have call successors, (148), 2 states have call predecessors, (148), 2 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-08 10:35:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 574 transitions. [2025-03-08 10:35:44,857 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 574 transitions. Word has length 444 [2025-03-08 10:35:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:35:44,859 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 574 transitions. [2025-03-08 10:35:44,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 574 transitions. [2025-03-08 10:35:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-08 10:35:44,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:44,862 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:44,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:35:44,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:44,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1035199817, now seen corresponding path program 1 times [2025-03-08 10:35:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555225767] [2025-03-08 10:35:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:44,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-08 10:35:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-08 10:35:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:45,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:35:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555225767] [2025-03-08 10:35:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555225767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:35:50,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:35:50,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:35:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071313354] [2025-03-08 10:35:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:35:50,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:35:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:35:50,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:35:50,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:35:50,385 INFO L87 Difference]: Start difference. First operand 351 states and 574 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:35:52,430 INFO L93 Difference]: Finished difference Result 969 states and 1557 transitions. [2025-03-08 10:35:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:35:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 444 [2025-03-08 10:35:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:35:52,438 INFO L225 Difference]: With dead ends: 969 [2025-03-08 10:35:52,439 INFO L226 Difference]: Without dead ends: 621 [2025-03-08 10:35:52,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:35:52,442 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 330 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:35:52,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1593 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 10:35:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-08 10:35:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 534. [2025-03-08 10:35:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 307 states have (on average 1.3745928338762214) internal successors, (422), 307 states have internal predecessors, (422), 222 states have call successors, (222), 4 states have call predecessors, (222), 4 states have return successors, (222), 222 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-08 10:35:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 866 transitions. [2025-03-08 10:35:52,542 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 866 transitions. Word has length 444 [2025-03-08 10:35:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:35:52,544 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 866 transitions. [2025-03-08 10:35:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 866 transitions. [2025-03-08 10:35:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:35:52,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:52,548 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:35:52,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1347268925, now seen corresponding path program 1 times [2025-03-08 10:35:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907583587] [2025-03-08 10:35:52,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:52,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:35:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:35:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 9 proven. 210 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:35:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907583587] [2025-03-08 10:35:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907583587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:35:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339513036] [2025-03-08 10:35:53,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:35:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:35:53,053 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 10:35:53,055 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 10:35:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:35:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:35:53,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:53,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:53,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:35:53,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:35:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 919 proven. 210 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2025-03-08 10:35:53,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:35:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 9 proven. 210 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:35:54,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339513036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:35:54,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:35:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 10:35:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552646041] [2025-03-08 10:35:54,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:35:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:35:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:35:54,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:35:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:35:54,330 INFO L87 Difference]: Start difference. First operand 534 states and 866 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 2 states have call predecessors, (145), 2 states have call successors, (145) [2025-03-08 10:35:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:35:54,680 INFO L93 Difference]: Finished difference Result 904 states and 1452 transitions. [2025-03-08 10:35:54,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:35:54,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 2 states have call predecessors, (145), 2 states have call successors, (145) Word has length 445 [2025-03-08 10:35:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:35:54,686 INFO L225 Difference]: With dead ends: 904 [2025-03-08 10:35:54,688 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 10:35:54,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 887 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:35:54,691 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 78 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:35:54,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 444 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:35:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 10:35:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 528. [2025-03-08 10:35:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 298 states have (on average 1.332214765100671) internal successors, (397), 298 states have internal predecessors, (397), 222 states have call successors, (222), 7 states have call predecessors, (222), 7 states have return successors, (222), 222 states have call predecessors, (222), 222 states have call successors, (222) [2025-03-08 10:35:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 841 transitions. [2025-03-08 10:35:54,762 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 841 transitions. Word has length 445 [2025-03-08 10:35:54,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:35:54,763 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 841 transitions. [2025-03-08 10:35:54,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (144), 2 states have call predecessors, (144), 4 states have return successors, (145), 2 states have call predecessors, (145), 2 states have call successors, (145) [2025-03-08 10:35:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 841 transitions. [2025-03-08 10:35:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:35:54,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:54,768 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:54,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:35:54,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 10:35:54,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1121925059, now seen corresponding path program 1 times [2025-03-08 10:35:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694279305] [2025-03-08 10:35:54,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:35:55,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:35:55,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:55,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:35:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694279305] [2025-03-08 10:35:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694279305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:35:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:35:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:35:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337202354] [2025-03-08 10:35:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:35:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:35:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:35:55,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:35:55,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:35:55,277 INFO L87 Difference]: Start difference. First operand 528 states and 841 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:35:55,595 INFO L93 Difference]: Finished difference Result 1219 states and 1950 transitions. [2025-03-08 10:35:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:35:55,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 445 [2025-03-08 10:35:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:35:55,602 INFO L225 Difference]: With dead ends: 1219 [2025-03-08 10:35:55,602 INFO L226 Difference]: Without dead ends: 870 [2025-03-08 10:35:55,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:35:55,605 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 282 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:35:55,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1161 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:35:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-08 10:35:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 866. [2025-03-08 10:35:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 484 states have (on average 1.3305785123966942) internal successors, (644), 484 states have internal predecessors, (644), 370 states have call successors, (370), 11 states have call predecessors, (370), 11 states have return successors, (370), 370 states have call predecessors, (370), 370 states have call successors, (370) [2025-03-08 10:35:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1384 transitions. [2025-03-08 10:35:55,697 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1384 transitions. Word has length 445 [2025-03-08 10:35:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:35:55,698 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1384 transitions. [2025-03-08 10:35:55,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:35:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1384 transitions. [2025-03-08 10:35:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:35:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:35:55,700 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:55,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:35:55,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:35:55,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:35:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1365587774, now seen corresponding path program 1 times [2025-03-08 10:35:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:35:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096307394] [2025-03-08 10:35:55,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:35:55,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:35:55,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:35:55,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:55,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 24 proven. 195 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:35:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:35:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096307394] [2025-03-08 10:35:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096307394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:35:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572753524] [2025-03-08 10:35:56,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:35:56,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:35:56,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:35:56,373 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 10:35:56,375 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 10:35:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:35:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:35:56,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:35:56,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:35:56,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 10:35:56,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:36:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 2253 proven. 936 refuted. 0 times theorem prover too weak. 7615 trivial. 0 not checked. [2025-03-08 10:36:01,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:36:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572753524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:36:29,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:36:29,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2025-03-08 10:36:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680527268] [2025-03-08 10:36:29,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:36:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 10:36:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:36:29,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 10:36:29,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1083, Unknown=1, NotChecked=0, Total=1482 [2025-03-08 10:36:29,401 INFO L87 Difference]: Start difference. First operand 866 states and 1384 transitions. Second operand has 26 states, 26 states have (on average 6.5) internal successors, (169), 24 states have internal predecessors, (169), 8 states have call successors, (148), 7 states have call predecessors, (148), 10 states have return successors, (148), 8 states have call predecessors, (148), 8 states have call successors, (148) [2025-03-08 10:36:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:36:34,177 INFO L93 Difference]: Finished difference Result 2180 states and 3310 transitions. [2025-03-08 10:36:34,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 10:36:34,178 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.5) internal successors, (169), 24 states have internal predecessors, (169), 8 states have call successors, (148), 7 states have call predecessors, (148), 10 states have return successors, (148), 8 states have call predecessors, (148), 8 states have call successors, (148) Word has length 445 [2025-03-08 10:36:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:36:34,190 INFO L225 Difference]: With dead ends: 2180 [2025-03-08 10:36:34,191 INFO L226 Difference]: Without dead ends: 1484 [2025-03-08 10:36:34,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 955 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=2943, Invalid=9266, Unknown=1, NotChecked=0, Total=12210 [2025-03-08 10:36:34,197 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1436 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 1057 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1057 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:36:34,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 1516 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1057 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 10:36:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-03-08 10:36:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1008. [2025-03-08 10:36:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 589 states have (on average 1.2801358234295417) internal successors, (754), 590 states have internal predecessors, (754), 378 states have call successors, (378), 40 states have call predecessors, (378), 40 states have return successors, (378), 377 states have call predecessors, (378), 378 states have call successors, (378) [2025-03-08 10:36:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1510 transitions. [2025-03-08 10:36:34,329 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1510 transitions. Word has length 445 [2025-03-08 10:36:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:36:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1510 transitions. [2025-03-08 10:36:34,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.5) internal successors, (169), 24 states have internal predecessors, (169), 8 states have call successors, (148), 7 states have call predecessors, (148), 10 states have return successors, (148), 8 states have call predecessors, (148), 8 states have call successors, (148) [2025-03-08 10:36:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1510 transitions. [2025-03-08 10:36:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:36:34,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:36:34,334 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:36:34,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 10:36:34,535 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 10:36:34,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:36:34,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:36:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1178852741, now seen corresponding path program 1 times [2025-03-08 10:36:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:36:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338911196] [2025-03-08 10:36:34,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:36:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:36:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:36:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:36:34,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:36:34,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:36:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 3 proven. 216 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:36:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:36:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338911196] [2025-03-08 10:36:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338911196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:36:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968364132] [2025-03-08 10:36:34,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:36:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:36:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:36:34,971 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 10:36:34,973 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 10:36:35,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:36:35,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:36:35,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:36:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:36:35,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 10:36:35,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:36:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 363 proven. 216 refuted. 0 times theorem prover too weak. 10225 trivial. 0 not checked. [2025-03-08 10:36:35,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:36:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 3 proven. 216 refuted. 0 times theorem prover too weak. 10585 trivial. 0 not checked. [2025-03-08 10:36:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968364132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:36:36,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:36:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 10:36:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307053667] [2025-03-08 10:36:36,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:36:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:36:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:36:36,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:36:36,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:36:36,235 INFO L87 Difference]: Start difference. First operand 1008 states and 1510 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (146), 2 states have call predecessors, (146), 4 states have return successors, (147), 2 states have call predecessors, (147), 2 states have call successors, (147) [2025-03-08 10:36:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:36:37,634 INFO L93 Difference]: Finished difference Result 2340 states and 3444 transitions. [2025-03-08 10:36:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 10:36:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (146), 2 states have call predecessors, (146), 4 states have return successors, (147), 2 states have call predecessors, (147), 2 states have call successors, (147) Word has length 445 [2025-03-08 10:36:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:36:37,650 INFO L225 Difference]: With dead ends: 2340 [2025-03-08 10:36:37,650 INFO L226 Difference]: Without dead ends: 1521 [2025-03-08 10:36:37,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 883 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-08 10:36:37,656 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 469 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:36:37,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1621 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 10:36:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-08 10:36:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1032. [2025-03-08 10:36:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 609 states have (on average 1.270935960591133) internal successors, (774), 610 states have internal predecessors, (774), 378 states have call successors, (378), 44 states have call predecessors, (378), 44 states have return successors, (378), 377 states have call predecessors, (378), 378 states have call successors, (378) [2025-03-08 10:36:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1530 transitions. [2025-03-08 10:36:37,817 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1530 transitions. Word has length 445 [2025-03-08 10:36:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:36:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1530 transitions. [2025-03-08 10:36:37,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 2 states have call successors, (146), 2 states have call predecessors, (146), 4 states have return successors, (147), 2 states have call predecessors, (147), 2 states have call successors, (147) [2025-03-08 10:36:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1530 transitions. [2025-03-08 10:36:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-08 10:36:37,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:36:37,821 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:36:37,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 10:36:38,021 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 10:36:38,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:36:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:36:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1177929220, now seen corresponding path program 1 times [2025-03-08 10:36:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:36:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748018492] [2025-03-08 10:36:38,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:36:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:36:38,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-08 10:36:38,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-08 10:36:38,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:36:38,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:36:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-08 10:36:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:36:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748018492] [2025-03-08 10:36:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748018492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:36:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:36:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:36:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025676350] [2025-03-08 10:36:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:36:38,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:36:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:36:38,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:36:38,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:36:38,191 INFO L87 Difference]: Start difference. First operand 1032 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:36:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:36:38,346 INFO L93 Difference]: Finished difference Result 1687 states and 2489 transitions. [2025-03-08 10:36:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:36:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 445 [2025-03-08 10:36:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:36:38,353 INFO L225 Difference]: With dead ends: 1687 [2025-03-08 10:36:38,353 INFO L226 Difference]: Without dead ends: 832 [2025-03-08 10:36:38,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 10:36:38,356 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 272 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:36:38,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 536 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:36:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-08 10:36:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 828. [2025-03-08 10:36:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 487 states have (on average 1.2607802874743326) internal successors, (614), 488 states have internal predecessors, (614), 304 states have call successors, (304), 36 states have call predecessors, (304), 36 states have return successors, (304), 303 states have call predecessors, (304), 304 states have call successors, (304) [2025-03-08 10:36:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1222 transitions. [2025-03-08 10:36:38,466 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1222 transitions. Word has length 445 [2025-03-08 10:36:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:36:38,466 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1222 transitions. [2025-03-08 10:36:38,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-08 10:36:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1222 transitions. [2025-03-08 10:36:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-08 10:36:38,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:36:38,469 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:36:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:36:38,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:36:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:36:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1009448470, now seen corresponding path program 1 times [2025-03-08 10:36:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:36:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354359266] [2025-03-08 10:36:38,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:36:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:36:38,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 10:36:38,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 10:36:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:36:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:36:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806061087] [2025-03-08 10:36:38,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:36:38,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:36:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:36:38,647 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 10:36:38,648 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 10:36:38,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 10:36:38,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 10:36:38,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:36:38,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:36:38,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 10:36:38,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:36:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 7171 proven. 213 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2025-03-08 10:36:44,929 INFO L312 TraceCheckSpWp]: Computing backward predicates...