./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.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-250_file-57.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 0046004d78dce3324da2f2f9d6f041cc4a293921335da3962eaba3f6eb6b0521 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:59:57,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:59:57,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:59:57,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:59:57,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:59:57,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:59:57,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:59:57,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:59:57,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:59:57,930 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:59:57,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:59:57,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:59:57,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:59:57,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:59:57,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:59:57,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:59:57,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:59:57,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:59:57,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:59:57,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:59:57,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:59:57,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:59:57,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:57,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:59:57,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:59:57,935 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 -> 0046004d78dce3324da2f2f9d6f041cc4a293921335da3962eaba3f6eb6b0521 [2025-03-08 10:59:58,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:59:58,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:59:58,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:59:58,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:59:58,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:59:58,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i [2025-03-08 10:59:59,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b06c9ea9e/b4bb7c132d8942d0a339df8b44c20bf2/FLAG1cff60ad6 [2025-03-08 10:59:59,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:59:59,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i [2025-03-08 10:59:59,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b06c9ea9e/b4bb7c132d8942d0a339df8b44c20bf2/FLAG1cff60ad6 [2025-03-08 10:59:59,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b06c9ea9e/b4bb7c132d8942d0a339df8b44c20bf2 [2025-03-08 10:59:59,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:59:59,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:59:59,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:59,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:59:59,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:59:59,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:59" (1/1) ... [2025-03-08 10:59:59,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47254d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:59, skipping insertion in model container [2025-03-08 10:59:59,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:59" (1/1) ... [2025-03-08 10:59:59,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:00:00,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i[916,929] [2025-03-08 11:00:00,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:00:00,256 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:00:00,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-57.i[916,929] [2025-03-08 11:00:00,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:00:00,340 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:00:00,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00 WrapperNode [2025-03-08 11:00:00,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:00:00,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:00:00,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:00:00,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:00:00,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,427 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-03-08 11:00:00,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:00:00,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:00:00,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:00:00,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:00:00,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,493 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 11:00:00,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:00:00,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:00:00,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:00:00,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:00:00,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (1/1) ... [2025-03-08 11:00:00,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:00:00,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:00,578 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 11:00:00,580 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 11:00:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:00:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:00:00,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:00:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:00:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:00:00,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:00:00,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:00:00,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:00:01,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc property_#t~bitwise69#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1; [2025-03-08 11:00:01,492 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 11:00:01,493 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:00:01,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:00:01,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:00:01,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:00:01 BoogieIcfgContainer [2025-03-08 11:00:01,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:00:01,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:00:01,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:00:01,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:00:01,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:59:59" (1/3) ... [2025-03-08 11:00:01,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a24f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:00:01, skipping insertion in model container [2025-03-08 11:00:01,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:00:00" (2/3) ... [2025-03-08 11:00:01,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a24f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:00:01, skipping insertion in model container [2025-03-08 11:00:01,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:00:01" (3/3) ... [2025-03-08 11:00:01,556 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-57.i [2025-03-08 11:00:01,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:00:01,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-57.i that has 2 procedures, 276 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:00:01,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:00:01,631 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;@395eb4a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:00:01,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:00:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 276 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 176 states have internal predecessors, (260), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 11:00:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:01,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:01,661 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:01,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:01,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 111650241, now seen corresponding path program 1 times [2025-03-08 11:00:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:01,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109545969] [2025-03-08 11:00:01,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:01,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:01,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:01,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 11:00:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109545969] [2025-03-08 11:00:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109545969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:00:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052492843] [2025-03-08 11:00:02,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:02,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:02,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:02,170 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 11:00:02,172 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 11:00:02,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:02,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:02,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:02,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:02,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:00:02,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-08 11:00:02,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:00:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052492843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:02,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:00:02,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:00:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653662707] [2025-03-08 11:00:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:02,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:00:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:02,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:00:02,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:00:02,576 INFO L87 Difference]: Start difference. First operand has 276 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 176 states have internal predecessors, (260), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:00:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:02,654 INFO L93 Difference]: Finished difference Result 546 states and 1005 transitions. [2025-03-08 11:00:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:00:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 604 [2025-03-08 11:00:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:02,665 INFO L225 Difference]: With dead ends: 546 [2025-03-08 11:00:02,665 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 11:00:02,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 605 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 11:00:02,672 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:02,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 11:00:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-08 11:00:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 173 states have (on average 1.4682080924855492) internal successors, (254), 173 states have internal predecessors, (254), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 11:00:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 450 transitions. [2025-03-08 11:00:02,781 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 450 transitions. Word has length 604 [2025-03-08 11:00:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:02,782 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 450 transitions. [2025-03-08 11:00:02,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:00:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 450 transitions. [2025-03-08 11:00:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:02,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:02,793 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:02,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:00:02,994 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 11:00:02,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:02,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1679542919, now seen corresponding path program 1 times [2025-03-08 11:00:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544243857] [2025-03-08 11:00:02,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:03,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:03,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:03,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544243857] [2025-03-08 11:00:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544243857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051439280] [2025-03-08 11:00:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:03,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:03,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:03,593 INFO L87 Difference]: Start difference. First operand 273 states and 450 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:03,692 INFO L93 Difference]: Finished difference Result 713 states and 1178 transitions. [2025-03-08 11:00:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 604 [2025-03-08 11:00:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:03,698 INFO L225 Difference]: With dead ends: 713 [2025-03-08 11:00:03,698 INFO L226 Difference]: Without dead ends: 443 [2025-03-08 11:00:03,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:03,700 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 278 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:03,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1119 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-08 11:00:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2025-03-08 11:00:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 301 states have (on average 1.5116279069767442) internal successors, (455), 302 states have internal predecessors, (455), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 11:00:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 727 transitions. [2025-03-08 11:00:03,762 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 727 transitions. Word has length 604 [2025-03-08 11:00:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:03,767 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 727 transitions. [2025-03-08 11:00:03,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 727 transitions. [2025-03-08 11:00:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:03,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:03,781 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:03,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:00:03,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1846254362, now seen corresponding path program 1 times [2025-03-08 11:00:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40999503] [2025-03-08 11:00:03,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:03,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:03,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:03,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:03,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40999503] [2025-03-08 11:00:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40999503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755647424] [2025-03-08 11:00:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:04,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:04,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:04,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:04,129 INFO L87 Difference]: Start difference. First operand 440 states and 727 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:04,252 INFO L93 Difference]: Finished difference Result 1161 states and 1910 transitions. [2025-03-08 11:00:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:04,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 604 [2025-03-08 11:00:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:04,263 INFO L225 Difference]: With dead ends: 1161 [2025-03-08 11:00:04,264 INFO L226 Difference]: Without dead ends: 724 [2025-03-08 11:00:04,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:04,266 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 236 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:04,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 970 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-08 11:00:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 721. [2025-03-08 11:00:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 500 states have (on average 1.492) internal successors, (746), 503 states have internal predecessors, (746), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 213 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-08 11:00:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1178 transitions. [2025-03-08 11:00:04,322 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1178 transitions. Word has length 604 [2025-03-08 11:00:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:04,324 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1178 transitions. [2025-03-08 11:00:04,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1178 transitions. [2025-03-08 11:00:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:04,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:04,335 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:04,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:00:04,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -384674363, now seen corresponding path program 1 times [2025-03-08 11:00:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107292568] [2025-03-08 11:00:04,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:04,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:04,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:04,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107292568] [2025-03-08 11:00:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107292568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497521147] [2025-03-08 11:00:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:04,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:04,605 INFO L87 Difference]: Start difference. First operand 721 states and 1178 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:04,694 INFO L93 Difference]: Finished difference Result 1456 states and 2374 transitions. [2025-03-08 11:00:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:04,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 604 [2025-03-08 11:00:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:04,702 INFO L225 Difference]: With dead ends: 1456 [2025-03-08 11:00:04,702 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 11:00:04,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:04,706 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 220 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:04,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 912 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 11:00:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 521. [2025-03-08 11:00:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 381 states have (on average 1.5196850393700787) internal successors, (579), 382 states have internal predecessors, (579), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 11:00:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 851 transitions. [2025-03-08 11:00:04,749 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 851 transitions. Word has length 604 [2025-03-08 11:00:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:04,750 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 851 transitions. [2025-03-08 11:00:04,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 851 transitions. [2025-03-08 11:00:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:04,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:04,755 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:04,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:00:04,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:04,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1833083590, now seen corresponding path program 1 times [2025-03-08 11:00:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451151615] [2025-03-08 11:00:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:04,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:04,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:04,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:04,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451151615] [2025-03-08 11:00:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451151615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985790045] [2025-03-08 11:00:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:04,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:04,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:04,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:04,992 INFO L87 Difference]: Start difference. First operand 521 states and 851 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:05,057 INFO L93 Difference]: Finished difference Result 1440 states and 2357 transitions. [2025-03-08 11:00:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 604 [2025-03-08 11:00:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:05,063 INFO L225 Difference]: With dead ends: 1440 [2025-03-08 11:00:05,063 INFO L226 Difference]: Without dead ends: 922 [2025-03-08 11:00:05,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:05,065 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 244 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:05,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 868 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-08 11:00:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 918. [2025-03-08 11:00:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 712 states have (on average 1.550561797752809) internal successors, (1104), 715 states have internal predecessors, (1104), 200 states have call successors, (200), 5 states have call predecessors, (200), 5 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 11:00:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1504 transitions. [2025-03-08 11:00:05,104 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1504 transitions. Word has length 604 [2025-03-08 11:00:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:05,105 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1504 transitions. [2025-03-08 11:00:05,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1504 transitions. [2025-03-08 11:00:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:05,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:05,110 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:05,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:00:05,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1217119225, now seen corresponding path program 1 times [2025-03-08 11:00:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279912855] [2025-03-08 11:00:05,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:05,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:05,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:05,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:05,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279912855] [2025-03-08 11:00:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279912855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:05,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:00:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616723402] [2025-03-08 11:00:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:05,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:00:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:05,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:00:05,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:05,374 INFO L87 Difference]: Start difference. First operand 918 states and 1504 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:05,485 INFO L93 Difference]: Finished difference Result 2744 states and 4498 transitions. [2025-03-08 11:00:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 604 [2025-03-08 11:00:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:05,497 INFO L225 Difference]: With dead ends: 2744 [2025-03-08 11:00:05,497 INFO L226 Difference]: Without dead ends: 1829 [2025-03-08 11:00:05,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:00:05,500 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 438 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:05,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1135 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:00:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-03-08 11:00:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1827. [2025-03-08 11:00:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1416 states have (on average 1.5480225988700564) internal successors, (2192), 1422 states have internal predecessors, (2192), 400 states have call successors, (400), 10 states have call predecessors, (400), 10 states have return successors, (400), 394 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-08 11:00:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2992 transitions. [2025-03-08 11:00:05,605 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2992 transitions. Word has length 604 [2025-03-08 11:00:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:05,606 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2992 transitions. [2025-03-08 11:00:05,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2992 transitions. [2025-03-08 11:00:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 11:00:05,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:05,611 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:05,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:00:05,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -672280250, now seen corresponding path program 1 times [2025-03-08 11:00:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261415250] [2025-03-08 11:00:05,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:05,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:05,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:05,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 285 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 11:00:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261415250] [2025-03-08 11:00:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261415250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:00:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137545864] [2025-03-08 11:00:06,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:06,454 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 11:00:06,456 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 11:00:06,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 11:00:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 11:00:06,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:06,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:06,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:00:06,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 7623 proven. 78 refuted. 0 times theorem prover too weak. 11311 trivial. 0 not checked. [2025-03-08 11:00:07,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:00:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 213 proven. 78 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-08 11:00:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137545864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:00:07,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:00:07,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-08 11:00:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495040590] [2025-03-08 11:00:07,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:00:07,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:00:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:07,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:00:07,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:00:07,626 INFO L87 Difference]: Start difference. First operand 1827 states and 2992 transitions. Second operand has 11 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) [2025-03-08 11:00:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:08,763 INFO L93 Difference]: Finished difference Result 3727 states and 6055 transitions. [2025-03-08 11:00:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:00:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) Word has length 604 [2025-03-08 11:00:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:08,774 INFO L225 Difference]: With dead ends: 3727 [2025-03-08 11:00:08,775 INFO L226 Difference]: Without dead ends: 1903 [2025-03-08 11:00:08,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:00:08,780 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1010 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 686 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:08,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1193 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [686 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:00:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-03-08 11:00:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1883. [2025-03-08 11:00:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1462 states have (on average 1.5198358413132695) internal successors, (2222), 1468 states have internal predecessors, (2222), 400 states have call successors, (400), 20 states have call predecessors, (400), 20 states have return successors, (400), 394 states have call predecessors, (400), 400 states have call successors, (400) [2025-03-08 11:00:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 3022 transitions. [2025-03-08 11:00:08,884 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 3022 transitions. Word has length 604 [2025-03-08 11:00:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:08,886 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 3022 transitions. [2025-03-08 11:00:08,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 4 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (221), 4 states have call predecessors, (221), 4 states have call successors, (221) [2025-03-08 11:00:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 3022 transitions. [2025-03-08 11:00:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-03-08 11:00:08,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:08,891 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:08,898 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 11:00:09,091 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,SelfDestructingSolverStorable6 [2025-03-08 11:00:09,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:09,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash -30164614, now seen corresponding path program 1 times [2025-03-08 11:00:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979568394] [2025-03-08 11:00:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:09,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-03-08 11:00:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-03-08 11:00:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979568394] [2025-03-08 11:00:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979568394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:00:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319072853] [2025-03-08 11:00:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:10,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:00:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:10,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:00:10,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:00:10,024 INFO L87 Difference]: Start difference. First operand 1883 states and 3022 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:00:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:12,138 INFO L93 Difference]: Finished difference Result 8079 states and 12833 transitions. [2025-03-08 11:00:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:00:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) Word has length 605 [2025-03-08 11:00:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:12,171 INFO L225 Difference]: With dead ends: 8079 [2025-03-08 11:00:12,172 INFO L226 Difference]: Without dead ends: 6199 [2025-03-08 11:00:12,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:00:12,180 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 857 mSDsluCounter, 2895 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:12,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 3705 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2035 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 11:00:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states. [2025-03-08 11:00:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 4953. [2025-03-08 11:00:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4953 states, 3776 states have (on average 1.478813559322034) internal successors, (5584), 3804 states have internal predecessors, (5584), 1104 states have call successors, (1104), 72 states have call predecessors, (1104), 72 states have return successors, (1104), 1076 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-03-08 11:00:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 7792 transitions. [2025-03-08 11:00:12,519 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 7792 transitions. Word has length 605 [2025-03-08 11:00:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:12,520 INFO L471 AbstractCegarLoop]: Abstraction has 4953 states and 7792 transitions. [2025-03-08 11:00:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 2 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 2 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-08 11:00:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 7792 transitions. [2025-03-08 11:00:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:00:12,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:12,527 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:12,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:00:12,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:12,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:12,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1748588059, now seen corresponding path program 1 times [2025-03-08 11:00:12,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:12,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52956518] [2025-03-08 11:00:12,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:12,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:00:12,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:00:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-08 11:00:13,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:13,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52956518] [2025-03-08 11:00:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52956518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:13,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:00:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058041879] [2025-03-08 11:00:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:13,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:00:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:13,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:00:13,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:00:13,120 INFO L87 Difference]: Start difference. First operand 4953 states and 7792 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:14,736 INFO L93 Difference]: Finished difference Result 12339 states and 19378 transitions. [2025-03-08 11:00:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:00:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 606 [2025-03-08 11:00:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:14,781 INFO L225 Difference]: With dead ends: 12339 [2025-03-08 11:00:14,781 INFO L226 Difference]: Without dead ends: 7389 [2025-03-08 11:00:14,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:00:14,797 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 731 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:14,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 2923 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:00:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2025-03-08 11:00:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 5081. [2025-03-08 11:00:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5081 states, 3904 states have (on average 1.4815573770491803) internal successors, (5784), 3932 states have internal predecessors, (5784), 1104 states have call successors, (1104), 72 states have call predecessors, (1104), 72 states have return successors, (1104), 1076 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-03-08 11:00:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 7992 transitions. [2025-03-08 11:00:15,172 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 7992 transitions. Word has length 606 [2025-03-08 11:00:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:15,173 INFO L471 AbstractCegarLoop]: Abstraction has 5081 states and 7992 transitions. [2025-03-08 11:00:15,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-08 11:00:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 7992 transitions. [2025-03-08 11:00:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 11:00:15,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:15,183 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:15,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:00:15,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:15,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1368602948, now seen corresponding path program 1 times [2025-03-08 11:00:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170386711] [2025-03-08 11:00:15,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:15,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:00:15,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:00:15,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:15,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:00:15,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853741909] [2025-03-08 11:00:15,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:15,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:15,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:15,521 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 11:00:15,524 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 11:00:15,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 11:00:15,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 11:00:15,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:15,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 11:00:15,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 12675 proven. 78 refuted. 0 times theorem prover too weak. 6259 trivial. 0 not checked. [2025-03-08 11:00:17,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:00:18,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170386711] [2025-03-08 11:00:18,891 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:00:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853741909] [2025-03-08 11:00:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853741909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:00:18,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:00:18,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-08 11:00:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682611186] [2025-03-08 11:00:18,892 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 11:00:18,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:00:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:18,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:00:18,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-08 11:00:18,893 INFO L87 Difference]: Start difference. First operand 5081 states and 7992 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-08 11:00:24,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:28,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:32,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:37,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:41,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:45,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 11:00:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:46,242 INFO L93 Difference]: Finished difference Result 13815 states and 21447 transitions. [2025-03-08 11:00:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 11:00:46,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) Word has length 606 [2025-03-08 11:00:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:46,299 INFO L225 Difference]: With dead ends: 13815 [2025-03-08 11:00:46,299 INFO L226 Difference]: Without dead ends: 8737 [2025-03-08 11:00:46,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 1041 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 11:00:46,317 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1649 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 504 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:46,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1570 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1261 Invalid, 6 Unknown, 0 Unchecked, 26.6s Time] [2025-03-08 11:00:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2025-03-08 11:00:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8581. [2025-03-08 11:00:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8581 states, 6616 states have (on average 1.4594921402660217) internal successors, (9656), 6676 states have internal predecessors, (9656), 1816 states have call successors, (1816), 148 states have call predecessors, (1816), 148 states have return successors, (1816), 1756 states have call predecessors, (1816), 1816 states have call successors, (1816) [2025-03-08 11:00:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8581 states to 8581 states and 13288 transitions. [2025-03-08 11:00:46,860 INFO L78 Accepts]: Start accepts. Automaton has 8581 states and 13288 transitions. Word has length 606 [2025-03-08 11:00:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:46,861 INFO L471 AbstractCegarLoop]: Abstraction has 8581 states and 13288 transitions. [2025-03-08 11:00:46,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 4 states have call successors, (98), 4 states have call predecessors, (98), 5 states have return successors, (98), 4 states have call predecessors, (98), 4 states have call successors, (98) [2025-03-08 11:00:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8581 states and 13288 transitions. [2025-03-08 11:00:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-08 11:00:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:46,871 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:46,881 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 11:00:47,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:47,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1139417363, now seen corresponding path program 1 times [2025-03-08 11:00:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585616678] [2025-03-08 11:00:47,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:47,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 11:00:47,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 11:00:47,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:00:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930191821] [2025-03-08 11:00:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:47,396 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 11:00:47,397 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 11:00:47,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 11:00:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 11:00:47,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:47,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 11:00:47,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6847 proven. 66 refuted. 0 times theorem prover too weak. 12099 trivial. 0 not checked. [2025-03-08 11:00:49,621 INFO L312 TraceCheckSpWp]: Computing backward predicates...