./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-13.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:54:57,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:54:57,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:54:57,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:54:57,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:54:57,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:54:57,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:54:57,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:54:57,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:54:57,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:54:57,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:54:57,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:54:57,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:54:57,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:54:57,531 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:54:57,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:54:57,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:54:57,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:54:57,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:54:57,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:57,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:54:57,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aed15da12260a7de82b1d58a50eef3670797f2722612a66426441482ea1c194 [2025-03-08 10:54:57,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:54:57,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:54:57,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:54:57,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:54:57,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:54:57,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-08 10:54:58,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0897f5cdf/d94ecbaa187f41b59865ce9c3c32c8c9/FLAG540fd5303 [2025-03-08 10:54:59,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:54:59,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-08 10:54:59,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0897f5cdf/d94ecbaa187f41b59865ce9c3c32c8c9/FLAG540fd5303 [2025-03-08 10:54:59,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0897f5cdf/d94ecbaa187f41b59865ce9c3c32c8c9 [2025-03-08 10:54:59,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:54:59,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:54:59,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:59,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:54:59,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:54:59,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aacb7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59, skipping insertion in model container [2025-03-08 10:54:59,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:54:59,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-03-08 10:54:59,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:59,736 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:54:59,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-13.i[916,929] [2025-03-08 10:54:59,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:54:59,822 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:54:59,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59 WrapperNode [2025-03-08 10:54:59,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:54:59,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:59,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:54:59,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:54:59,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,889 INFO L138 Inliner]: procedures = 26, calls = 96, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-03-08 10:54:59,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:54:59,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:54:59,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:54:59,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:54:59,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,929 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:54:59,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:54:59,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:54:59,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:54:59,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:54:59,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (1/1) ... [2025-03-08 10:54:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:54:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:00,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:55:00,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:55:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:55:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:55:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:55:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:55:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:55:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:55:00,111 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:55:00,114 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:55:00,602 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L460: havoc property_#t~bitwise61#1; [2025-03-08 10:55:00,688 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 10:55:00,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:55:00,706 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:55:00,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:55:00,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:00 BoogieIcfgContainer [2025-03-08 10:55:00,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:55:00,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:55:00,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:55:00,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:55:00,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:54:59" (1/3) ... [2025-03-08 10:55:00,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff59e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:00, skipping insertion in model container [2025-03-08 10:55:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:54:59" (2/3) ... [2025-03-08 10:55:00,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff59e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:55:00, skipping insertion in model container [2025-03-08 10:55:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:55:00" (3/3) ... [2025-03-08 10:55:00,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i [2025-03-08 10:55:00,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:55:00,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-13.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:55:00,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:55:00,780 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;@76431ba9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:55:00,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:55:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 10:55:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-08 10:55:00,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:00,804 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:00,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 641571268, now seen corresponding path program 1 times [2025-03-08 10:55:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486192426] [2025-03-08 10:55:00,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:00,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-08 10:55:00,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-08 10:55:00,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-03-08 10:55:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486192426] [2025-03-08 10:55:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486192426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737863473] [2025-03-08 10:55:01,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:01,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:01,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:55:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-08 10:55:01,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-08 10:55:01,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:01,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:55:01,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2025-03-08 10:55:01,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:55:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737863473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:55:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:55:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371957976] [2025-03-08 10:55:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:55:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:55:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:55:01,621 INFO L87 Difference]: Start difference. First operand has 240 states, 154 states have (on average 1.5129870129870129) internal successors, (233), 155 states have internal predecessors, (233), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-08 10:55:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:01,671 INFO L93 Difference]: Finished difference Result 473 states and 874 transitions. [2025-03-08 10:55:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:55:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) Word has length 525 [2025-03-08 10:55:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:01,679 INFO L225 Difference]: With dead ends: 473 [2025-03-08 10:55:01,679 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 10:55:01,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:55:01,685 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:01,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 10:55:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-08 10:55:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 83 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 10:55:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 390 transitions. [2025-03-08 10:55:01,757 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 390 transitions. Word has length 525 [2025-03-08 10:55:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:01,757 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 390 transitions. [2025-03-08 10:55:01,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (83), 2 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-08 10:55:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 390 transitions. [2025-03-08 10:55:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-08 10:55:01,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:01,769 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:01,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:55:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:55:01,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1924140097, now seen corresponding path program 1 times [2025-03-08 10:55:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642689759] [2025-03-08 10:55:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:02,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-08 10:55:02,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-08 10:55:02,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:02,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642689759] [2025-03-08 10:55:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642689759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:02,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:02,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626522469] [2025-03-08 10:55:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:02,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:02,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:02,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:02,505 INFO L87 Difference]: Start difference. First operand 236 states and 390 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:02,625 INFO L93 Difference]: Finished difference Result 693 states and 1148 transitions. [2025-03-08 10:55:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 525 [2025-03-08 10:55:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:02,636 INFO L225 Difference]: With dead ends: 693 [2025-03-08 10:55:02,637 INFO L226 Difference]: Without dead ends: 460 [2025-03-08 10:55:02,638 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 10:55:02,639 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 348 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:02,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 750 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:55:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-08 10:55:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2025-03-08 10:55:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 289 states have (on average 1.4567474048442905) internal successors, (421), 289 states have internal predecessors, (421), 166 states have call successors, (166), 2 states have call predecessors, (166), 2 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 10:55:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 753 transitions. [2025-03-08 10:55:02,698 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 753 transitions. Word has length 525 [2025-03-08 10:55:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:02,699 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 753 transitions. [2025-03-08 10:55:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 753 transitions. [2025-03-08 10:55:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-08 10:55:02,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:02,705 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:55:02,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1250744150, now seen corresponding path program 1 times [2025-03-08 10:55:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258530645] [2025-03-08 10:55:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-08 10:55:02,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-08 10:55:02,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:02,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258530645] [2025-03-08 10:55:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258530645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:02,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:02,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492471298] [2025-03-08 10:55:02,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:02,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:02,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:02,959 INFO L87 Difference]: Start difference. First operand 458 states and 753 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:03,044 INFO L93 Difference]: Finished difference Result 979 states and 1594 transitions. [2025-03-08 10:55:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-08 10:55:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:03,053 INFO L225 Difference]: With dead ends: 979 [2025-03-08 10:55:03,054 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 10:55:03,055 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 10:55:03,056 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 39 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:03,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 10:55:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 520. [2025-03-08 10:55:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 337 states have (on average 1.4332344213649852) internal successors, (483), 339 states have internal predecessors, (483), 178 states have call successors, (178), 4 states have call predecessors, (178), 4 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-08 10:55:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 839 transitions. [2025-03-08 10:55:03,114 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 839 transitions. Word has length 526 [2025-03-08 10:55:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:03,117 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 839 transitions. [2025-03-08 10:55:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 839 transitions. [2025-03-08 10:55:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-08 10:55:03,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:03,122 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:55:03,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:03,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 256807659, now seen corresponding path program 1 times [2025-03-08 10:55:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711767252] [2025-03-08 10:55:03,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:03,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-08 10:55:03,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-08 10:55:03,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:03,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711767252] [2025-03-08 10:55:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711767252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:03,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:55:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790956658] [2025-03-08 10:55:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:55:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:03,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:55:03,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:03,434 INFO L87 Difference]: Start difference. First operand 520 states and 839 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:03,514 INFO L93 Difference]: Finished difference Result 1553 states and 2510 transitions. [2025-03-08 10:55:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:55:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-08 10:55:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:03,521 INFO L225 Difference]: With dead ends: 1553 [2025-03-08 10:55:03,521 INFO L226 Difference]: Without dead ends: 1036 [2025-03-08 10:55:03,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:55:03,524 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 375 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:03,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1018 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:55:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-08 10:55:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1022. [2025-03-08 10:55:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 657 states have (on average 1.4292237442922375) internal successors, (939), 661 states have internal predecessors, (939), 356 states have call successors, (356), 8 states have call predecessors, (356), 8 states have return successors, (356), 352 states have call predecessors, (356), 356 states have call successors, (356) [2025-03-08 10:55:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1651 transitions. [2025-03-08 10:55:03,637 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1651 transitions. Word has length 526 [2025-03-08 10:55:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:03,637 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1651 transitions. [2025-03-08 10:55:03,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1651 transitions. [2025-03-08 10:55:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-08 10:55:03,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:03,641 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:55:03,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -665875924, now seen corresponding path program 1 times [2025-03-08 10:55:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78215176] [2025-03-08 10:55:03,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:03,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-08 10:55:03,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-08 10:55:03,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:03,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78215176] [2025-03-08 10:55:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78215176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:04,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:55:04,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980107745] [2025-03-08 10:55:04,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:04,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:55:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:04,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:55:04,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:55:04,315 INFO L87 Difference]: Start difference. First operand 1022 states and 1651 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:05,119 INFO L93 Difference]: Finished difference Result 2486 states and 4028 transitions. [2025-03-08 10:55:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:55:05,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 526 [2025-03-08 10:55:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:05,130 INFO L225 Difference]: With dead ends: 2486 [2025-03-08 10:55:05,131 INFO L226 Difference]: Without dead ends: 1467 [2025-03-08 10:55:05,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:55:05,135 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 336 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:05,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1515 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:55:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-08 10:55:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1345. [2025-03-08 10:55:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 896 states have (on average 1.4776785714285714) internal successors, (1324), 900 states have internal predecessors, (1324), 439 states have call successors, (439), 9 states have call predecessors, (439), 9 states have return successors, (439), 435 states have call predecessors, (439), 439 states have call successors, (439) [2025-03-08 10:55:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2202 transitions. [2025-03-08 10:55:05,255 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2202 transitions. Word has length 526 [2025-03-08 10:55:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2202 transitions. [2025-03-08 10:55:05,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2202 transitions. [2025-03-08 10:55:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 10:55:05,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:05,260 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:55:05,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:05,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1020444358, now seen corresponding path program 1 times [2025-03-08 10:55:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337797666] [2025-03-08 10:55:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:05,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337797666] [2025-03-08 10:55:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337797666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:05,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:05,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:55:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160690512] [2025-03-08 10:55:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:05,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:55:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:05,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:55:05,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:05,730 INFO L87 Difference]: Start difference. First operand 1345 states and 2202 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:06,212 INFO L93 Difference]: Finished difference Result 3851 states and 6251 transitions. [2025-03-08 10:55:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:55:06,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-08 10:55:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:06,227 INFO L225 Difference]: With dead ends: 3851 [2025-03-08 10:55:06,227 INFO L226 Difference]: Without dead ends: 2812 [2025-03-08 10:55:06,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:55:06,232 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 389 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:06,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 957 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:55:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-03-08 10:55:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2806. [2025-03-08 10:55:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 1904 states have (on average 1.474264705882353) internal successors, (2807), 1916 states have internal predecessors, (2807), 879 states have call successors, (879), 22 states have call predecessors, (879), 22 states have return successors, (879), 867 states have call predecessors, (879), 879 states have call successors, (879) [2025-03-08 10:55:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4565 transitions. [2025-03-08 10:55:06,525 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4565 transitions. Word has length 527 [2025-03-08 10:55:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:06,526 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4565 transitions. [2025-03-08 10:55:06,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4565 transitions. [2025-03-08 10:55:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 10:55:06,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:06,529 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:06,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:55:06,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:06,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1197313595, now seen corresponding path program 1 times [2025-03-08 10:55:06,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:06,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119883585] [2025-03-08 10:55:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:06,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:06,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:06,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:06,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:06,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119883585] [2025-03-08 10:55:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119883585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:06,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:55:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59326515] [2025-03-08 10:55:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:55:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:06,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:55:06,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:55:06,939 INFO L87 Difference]: Start difference. First operand 2806 states and 4565 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:07,449 INFO L93 Difference]: Finished difference Result 5742 states and 9184 transitions. [2025-03-08 10:55:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:55:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-08 10:55:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:07,471 INFO L225 Difference]: With dead ends: 5742 [2025-03-08 10:55:07,471 INFO L226 Difference]: Without dead ends: 3434 [2025-03-08 10:55:07,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:55:07,480 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 393 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:07,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1308 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:55:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-03-08 10:55:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 2854. [2025-03-08 10:55:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 1952 states have (on average 1.4707991803278688) internal successors, (2871), 1964 states have internal predecessors, (2871), 879 states have call successors, (879), 22 states have call predecessors, (879), 22 states have return successors, (879), 867 states have call predecessors, (879), 879 states have call successors, (879) [2025-03-08 10:55:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4629 transitions. [2025-03-08 10:55:07,759 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4629 transitions. Word has length 527 [2025-03-08 10:55:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:07,760 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4629 transitions. [2025-03-08 10:55:07,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4629 transitions. [2025-03-08 10:55:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 10:55:07,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:07,778 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:55:07,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 903910588, now seen corresponding path program 1 times [2025-03-08 10:55:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855458668] [2025-03-08 10:55:07,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:07,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:07,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:07,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:07,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:55:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855458668] [2025-03-08 10:55:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855458668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:55:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:55:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:55:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715203354] [2025-03-08 10:55:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:55:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:55:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:08,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:55:08,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:08,395 INFO L87 Difference]: Start difference. First operand 2854 states and 4629 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:08,697 INFO L93 Difference]: Finished difference Result 7230 states and 11712 transitions. [2025-03-08 10:55:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:55:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) Word has length 527 [2025-03-08 10:55:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:08,725 INFO L225 Difference]: With dead ends: 7230 [2025-03-08 10:55:08,725 INFO L226 Difference]: Without dead ends: 4553 [2025-03-08 10:55:08,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:55:08,735 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 389 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:08,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1191 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:55:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2025-03-08 10:55:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4394. [2025-03-08 10:55:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4394 states, 3191 states have (on average 1.4857411469758697) internal successors, (4741), 3223 states have internal predecessors, (4741), 1159 states have call successors, (1159), 43 states have call predecessors, (1159), 43 states have return successors, (1159), 1127 states have call predecessors, (1159), 1159 states have call successors, (1159) [2025-03-08 10:55:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 7059 transitions. [2025-03-08 10:55:09,034 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 7059 transitions. Word has length 527 [2025-03-08 10:55:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 4394 states and 7059 transitions. [2025-03-08 10:55:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 1 states have call predecessors, (83), 1 states have call successors, (83) [2025-03-08 10:55:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 7059 transitions. [2025-03-08 10:55:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 10:55:09,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:09,039 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:09,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:55:09,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:09,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash -346443462, now seen corresponding path program 1 times [2025-03-08 10:55:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639320810] [2025-03-08 10:55:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:09,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:09,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:09,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 138 proven. 108 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-08 10:55:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639320810] [2025-03-08 10:55:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639320810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:09,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045140234] [2025-03-08 10:55:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:09,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:55:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:09,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:09,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:09,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:09,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 10:55:09,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6582 proven. 96 refuted. 0 times theorem prover too weak. 6934 trivial. 0 not checked. [2025-03-08 10:55:10,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-08 10:55:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045140234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:55:10,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:55:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-08 10:55:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669041685] [2025-03-08 10:55:10,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:10,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:55:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:10,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:55:10,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:55:10,755 INFO L87 Difference]: Start difference. First operand 4394 states and 7059 transitions. Second operand has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) [2025-03-08 10:55:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:11,723 INFO L93 Difference]: Finished difference Result 8771 states and 13982 transitions. [2025-03-08 10:55:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:55:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) Word has length 527 [2025-03-08 10:55:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:11,751 INFO L225 Difference]: With dead ends: 8771 [2025-03-08 10:55:11,752 INFO L226 Difference]: Without dead ends: 4552 [2025-03-08 10:55:11,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1049 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:55:11,763 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 580 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:11,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1047 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:55:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2025-03-08 10:55:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4466. [2025-03-08 10:55:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 3245 states have (on average 1.473035439137134) internal successors, (4780), 3277 states have internal predecessors, (4780), 1159 states have call successors, (1159), 61 states have call predecessors, (1159), 61 states have return successors, (1159), 1127 states have call predecessors, (1159), 1159 states have call successors, (1159) [2025-03-08 10:55:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7098 transitions. [2025-03-08 10:55:12,056 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7098 transitions. Word has length 527 [2025-03-08 10:55:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 7098 transitions. [2025-03-08 10:55:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.363636363636363) internal successors, (224), 11 states have internal predecessors, (224), 4 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (153), 4 states have call predecessors, (153), 4 states have call successors, (153) [2025-03-08 10:55:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7098 transitions. [2025-03-08 10:55:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-08 10:55:12,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:12,061 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:12,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:55:12,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 10:55:12,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1115613477, now seen corresponding path program 1 times [2025-03-08 10:55:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104747158] [2025-03-08 10:55:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:12,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:12,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 270 proven. 216 refuted. 0 times theorem prover too weak. 13126 trivial. 0 not checked. [2025-03-08 10:55:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104747158] [2025-03-08 10:55:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104747158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262493358] [2025-03-08 10:55:13,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:13,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:55:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-08 10:55:13,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-08 10:55:13,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:13,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:13,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 10:55:13,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 9549 proven. 582 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2025-03-08 10:55:18,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262493358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:23,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:55:23,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2025-03-08 10:55:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460923828] [2025-03-08 10:55:23,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 10:55:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:23,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 10:55:23,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=1844, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 10:55:23,056 INFO L87 Difference]: Start difference. First operand 4466 states and 7098 transitions. Second operand has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) [2025-03-08 10:55:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:35,452 INFO L93 Difference]: Finished difference Result 38374 states and 59587 transitions. [2025-03-08 10:55:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-08 10:55:35,453 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) Word has length 527 [2025-03-08 10:55:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:35,561 INFO L225 Difference]: With dead ends: 38374 [2025-03-08 10:55:35,561 INFO L226 Difference]: Without dead ends: 34152 [2025-03-08 10:55:35,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10019 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6672, Invalid=21384, Unknown=0, NotChecked=0, Total=28056 [2025-03-08 10:55:35,588 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 9089 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 4513 mSolverCounterSat, 3896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9090 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 8409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3896 IncrementalHoareTripleChecker+Valid, 4513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:35,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9090 Valid, 3414 Invalid, 8409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3896 Valid, 4513 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 10:55:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34152 states. [2025-03-08 10:55:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34152 to 26128. [2025-03-08 10:55:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26128 states, 19987 states have (on average 1.4676039425626657) internal successors, (29333), 20279 states have internal predecessors, (29333), 5723 states have call successors, (5723), 417 states have call predecessors, (5723), 417 states have return successors, (5723), 5431 states have call predecessors, (5723), 5723 states have call successors, (5723) [2025-03-08 10:55:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26128 states to 26128 states and 40779 transitions. [2025-03-08 10:55:37,976 INFO L78 Accepts]: Start accepts. Automaton has 26128 states and 40779 transitions. Word has length 527 [2025-03-08 10:55:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 26128 states and 40779 transitions. [2025-03-08 10:55:37,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.026315789473684) internal successors, (229), 37 states have internal predecessors, (229), 11 states have call successors, (166), 9 states have call predecessors, (166), 14 states have return successors, (166), 11 states have call predecessors, (166), 11 states have call successors, (166) [2025-03-08 10:55:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26128 states and 40779 transitions. [2025-03-08 10:55:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 10:55:37,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:37,986 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:37,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:55:38,186 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 10:55:38,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1804760976, now seen corresponding path program 1 times [2025-03-08 10:55:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098853326] [2025-03-08 10:55:38,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:38,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 10:55:38,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 10:55:38,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-08 10:55:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098853326] [2025-03-08 10:55:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098853326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990046586] [2025-03-08 10:55:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:38,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:38,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:55:38,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 10:55:38,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 10:55:38,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:38,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:38,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:55:38,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6616 proven. 186 refuted. 0 times theorem prover too weak. 6810 trivial. 0 not checked. [2025-03-08 10:55:39,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 150 proven. 96 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-08 10:55:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990046586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:55:39,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:55:39,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-08 10:55:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372904129] [2025-03-08 10:55:39,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:39,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:55:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:39,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:55:39,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:55:39,836 INFO L87 Difference]: Start difference. First operand 26128 states and 40779 transitions. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) [2025-03-08 10:55:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:55:42,071 INFO L93 Difference]: Finished difference Result 51063 states and 79231 transitions. [2025-03-08 10:55:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:55:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) Word has length 528 [2025-03-08 10:55:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:55:42,170 INFO L225 Difference]: With dead ends: 51063 [2025-03-08 10:55:42,171 INFO L226 Difference]: Without dead ends: 25706 [2025-03-08 10:55:42,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 1052 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2025-03-08 10:55:42,222 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 589 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:55:42,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 647 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:55:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2025-03-08 10:55:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25026. [2025-03-08 10:55:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25026 states, 19162 states have (on average 1.459607556622482) internal successors, (27969), 19434 states have internal predecessors, (27969), 5443 states have call successors, (5443), 420 states have call predecessors, (5443), 420 states have return successors, (5443), 5171 states have call predecessors, (5443), 5443 states have call successors, (5443) [2025-03-08 10:55:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 38855 transitions. [2025-03-08 10:55:44,334 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 38855 transitions. Word has length 528 [2025-03-08 10:55:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:55:44,335 INFO L471 AbstractCegarLoop]: Abstraction has 25026 states and 38855 transitions. [2025-03-08 10:55:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 4 states have call successors, (147), 3 states have call predecessors, (147), 5 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148) [2025-03-08 10:55:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 38855 transitions. [2025-03-08 10:55:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 10:55:44,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:55:44,343 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:55:44,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 10:55:44,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:44,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:55:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:55:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1325259672, now seen corresponding path program 1 times [2025-03-08 10:55:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:55:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314523559] [2025-03-08 10:55:44,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:55:44,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 10:55:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 10:55:44,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 291 proven. 195 refuted. 0 times theorem prover too weak. 13126 trivial. 0 not checked. [2025-03-08 10:55:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:55:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314523559] [2025-03-08 10:55:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314523559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820836217] [2025-03-08 10:55:45,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:55:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:55:45,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:55:45,607 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:55:45,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 10:55:45,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 10:55:45,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 10:55:45,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:55:45,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:55:45,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 10:55:45,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:55:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 7829 proven. 582 refuted. 0 times theorem prover too weak. 5201 trivial. 0 not checked. [2025-03-08 10:55:48,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:55:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820836217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:55:49,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:55:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 25] total 30 [2025-03-08 10:55:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527785211] [2025-03-08 10:55:49,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:55:49,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 10:55:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:55:49,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 10:55:49,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 10:55:49,768 INFO L87 Difference]: Start difference. First operand 25026 states and 38855 transitions. Second operand has 30 states, 30 states have (on average 6.4) internal successors, (192), 29 states have internal predecessors, (192), 9 states have call successors, (122), 7 states have call predecessors, (122), 10 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) [2025-03-08 10:56:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:56:09,314 INFO L93 Difference]: Finished difference Result 159191 states and 243619 transitions. [2025-03-08 10:56:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-08 10:56:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 29 states have internal predecessors, (192), 9 states have call successors, (122), 7 states have call predecessors, (122), 10 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) Word has length 529 [2025-03-08 10:56:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:56:09,820 INFO L225 Difference]: With dead ends: 159191 [2025-03-08 10:56:09,820 INFO L226 Difference]: Without dead ends: 134940 [2025-03-08 10:56:09,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7424 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4451, Invalid=17011, Unknown=0, NotChecked=0, Total=21462 [2025-03-08 10:56:09,906 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 7077 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 3343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7077 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 7161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3343 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:56:09,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7077 Valid, 3305 Invalid, 7161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3343 Valid, 3818 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 10:56:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134940 states. [2025-03-08 10:56:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134940 to 53881. [2025-03-08 10:56:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53881 states, 41610 states have (on average 1.458447488584475) internal successors, (60686), 42238 states have internal predecessors, (60686), 11359 states have call successors, (11359), 911 states have call predecessors, (11359), 911 states have return successors, (11359), 10731 states have call predecessors, (11359), 11359 states have call successors, (11359) [2025-03-08 10:56:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53881 states to 53881 states and 83404 transitions. [2025-03-08 10:56:16,049 INFO L78 Accepts]: Start accepts. Automaton has 53881 states and 83404 transitions. Word has length 529 [2025-03-08 10:56:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:56:16,050 INFO L471 AbstractCegarLoop]: Abstraction has 53881 states and 83404 transitions. [2025-03-08 10:56:16,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 29 states have internal predecessors, (192), 9 states have call successors, (122), 7 states have call predecessors, (122), 10 states have return successors, (123), 9 states have call predecessors, (123), 9 states have call successors, (123) [2025-03-08 10:56:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 53881 states and 83404 transitions. [2025-03-08 10:56:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 10:56:16,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:56:16,064 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:56:16,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 10:56:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 10:56:16,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:56:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:56:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 300565751, now seen corresponding path program 1 times [2025-03-08 10:56:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:56:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214952618] [2025-03-08 10:56:16,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:56:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:56:16,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 10:56:16,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 10:56:16,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:56:16,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:56:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13612 trivial. 0 not checked. [2025-03-08 10:56:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:56:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214952618] [2025-03-08 10:56:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214952618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:56:16,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:56:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:56:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028410188] [2025-03-08 10:56:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:56:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:56:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:56:16,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:56:16,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:56:16,563 INFO L87 Difference]: Start difference. First operand 53881 states and 83404 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (83), 1 states have call predecessors, (83), 1 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83)