./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.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-99.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 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:04:37,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:04:37,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:04:37,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:04:37,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:04:37,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:04:37,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:04:37,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:04:37,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:04:37,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:04:37,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:04:37,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:04:37,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:04:37,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:04:37,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:04:37,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:04:37,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:04:37,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:04:37,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:04:37,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:04:37,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:04:37,780 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 -> 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 [2025-03-08 11:04:37,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:04:38,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:04:38,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:04:38,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:04:38,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:04:38,008 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-99.i [2025-03-08 11:04:39,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cb2010a/024c18eea4fb4986ae1f598ab4bc4957/FLAG5e135cbd6 [2025-03-08 11:04:39,400 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:04:39,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-03-08 11:04:39,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cb2010a/024c18eea4fb4986ae1f598ab4bc4957/FLAG5e135cbd6 [2025-03-08 11:04:39,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80cb2010a/024c18eea4fb4986ae1f598ab4bc4957 [2025-03-08 11:04:39,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:04:39,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:04:39,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:04:39,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:04:39,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:04:39,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:04:39" (1/1) ... [2025-03-08 11:04:39,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19db20ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:39, skipping insertion in model container [2025-03-08 11:04:39,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:04:39" (1/1) ... [2025-03-08 11:04:39,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:04:39,814 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-99.i[916,929] [2025-03-08 11:04:39,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:04:39,946 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:04:39,955 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-99.i[916,929] [2025-03-08 11:04:40,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:04:40,015 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:04:40,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40 WrapperNode [2025-03-08 11:04:40,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:04:40,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:04:40,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:04:40,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:04:40,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,071 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-03-08 11:04:40,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:04:40,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:04:40,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:04:40,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:04:40,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,109 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:04:40,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:04:40,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:04:40,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:04:40,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:04:40,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (1/1) ... [2025-03-08 11:04:40,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:04:40,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:04:40,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:04:40,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:04:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:04:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:04:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:04:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:04:40,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:04:40,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:04:40,256 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:04:40,257 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:04:40,767 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-08 11:04:40,834 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 11:04:40,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:04:40,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:04:40,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:04:40,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:04:40 BoogieIcfgContainer [2025-03-08 11:04:40,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:04:40,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:04:40,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:04:40,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:04:40,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:04:39" (1/3) ... [2025-03-08 11:04:40,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84e9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:04:40, skipping insertion in model container [2025-03-08 11:04:40,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:40" (2/3) ... [2025-03-08 11:04:40,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b84e9f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:04:40, skipping insertion in model container [2025-03-08 11:04:40,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:04:40" (3/3) ... [2025-03-08 11:04:40,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-03-08 11:04:40,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:04:40,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i that has 2 procedures, 246 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:04:40,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:04:40,936 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;@64381a21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:04:40,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:04:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 164 states have internal predecessors, (249), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 11:04:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-08 11:04:40,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:40,967 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:40,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 823254237, now seen corresponding path program 1 times [2025-03-08 11:04:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93681520] [2025-03-08 11:04:40,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:41,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 11:04:41,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 11:04:41,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-08 11:04:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:41,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93681520] [2025-03-08 11:04:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93681520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:04:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099221564] [2025-03-08 11:04:41,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:41,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:04:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:04:41,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:04:41,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:04:41,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 11:04:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 11:04:41,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:41,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:04:41,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:04:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-08 11:04:41,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:04:41,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099221564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:41,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:04:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:04:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719803728] [2025-03-08 11:04:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:41,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:04:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:41,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:04:41,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:04:41,749 INFO L87 Difference]: Start difference. First operand has 246 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 164 states have internal predecessors, (249), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-08 11:04:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:41,819 INFO L93 Difference]: Finished difference Result 486 states and 893 transitions. [2025-03-08 11:04:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:04:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 500 [2025-03-08 11:04:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:41,831 INFO L225 Difference]: With dead ends: 486 [2025-03-08 11:04:41,831 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 11:04:41,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:04:41,836 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:41,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:04:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 11:04:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-08 11:04:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 161 states have (on average 1.5093167701863355) internal successors, (243), 161 states have internal predecessors, (243), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-08 11:04:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 403 transitions. [2025-03-08 11:04:41,898 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 403 transitions. Word has length 500 [2025-03-08 11:04:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:41,900 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 403 transitions. [2025-03-08 11:04:41,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-08 11:04:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 403 transitions. [2025-03-08 11:04:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-08 11:04:41,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:41,908 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:41,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:04:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:04:42,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 272523677, now seen corresponding path program 1 times [2025-03-08 11:04:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236535154] [2025-03-08 11:04:42,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:42,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 11:04:42,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 11:04:42,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:42,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:42,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236535154] [2025-03-08 11:04:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236535154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:04:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620244270] [2025-03-08 11:04:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:04:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:42,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:04:42,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:42,538 INFO L87 Difference]: Start difference. First operand 243 states and 403 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:42,652 INFO L93 Difference]: Finished difference Result 650 states and 1082 transitions. [2025-03-08 11:04:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:04:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-03-08 11:04:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:42,674 INFO L225 Difference]: With dead ends: 650 [2025-03-08 11:04:42,676 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 11:04:42,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:42,679 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 269 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:42,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 867 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:04:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 11:04:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2025-03-08 11:04:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 282 states have internal predecessors, (432), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-08 11:04:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 678 transitions. [2025-03-08 11:04:42,736 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 678 transitions. Word has length 500 [2025-03-08 11:04:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 678 transitions. [2025-03-08 11:04:42,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 678 transitions. [2025-03-08 11:04:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-08 11:04:42,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:42,746 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:42,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:04:42,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:42,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2072143364, now seen corresponding path program 1 times [2025-03-08 11:04:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580911234] [2025-03-08 11:04:42,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:42,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 11:04:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 11:04:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:43,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580911234] [2025-03-08 11:04:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580911234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:43,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:43,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:04:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579607716] [2025-03-08 11:04:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:43,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:04:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:43,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:04:43,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:43,086 INFO L87 Difference]: Start difference. First operand 407 states and 678 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:43,198 INFO L93 Difference]: Finished difference Result 1141 states and 1904 transitions. [2025-03-08 11:04:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:04:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-03-08 11:04:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:43,208 INFO L225 Difference]: With dead ends: 1141 [2025-03-08 11:04:43,208 INFO L226 Difference]: Without dead ends: 737 [2025-03-08 11:04:43,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:43,211 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 275 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:43,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 942 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:04:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-08 11:04:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 734. [2025-03-08 11:04:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 518 states have (on average 1.5347490347490347) internal successors, (795), 521 states have internal predecessors, (795), 211 states have call successors, (211), 4 states have call predecessors, (211), 4 states have return successors, (211), 208 states have call predecessors, (211), 211 states have call successors, (211) [2025-03-08 11:04:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1217 transitions. [2025-03-08 11:04:43,273 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1217 transitions. Word has length 500 [2025-03-08 11:04:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:43,273 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1217 transitions. [2025-03-08 11:04:43,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1217 transitions. [2025-03-08 11:04:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-08 11:04:43,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:43,279 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:43,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:04:43,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:43,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1968087387, now seen corresponding path program 1 times [2025-03-08 11:04:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:43,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923125929] [2025-03-08 11:04:43,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-08 11:04:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-08 11:04:43,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923125929] [2025-03-08 11:04:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923125929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:04:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922329154] [2025-03-08 11:04:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:04:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:43,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:04:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:04:43,681 INFO L87 Difference]: Start difference. First operand 734 states and 1217 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:44,446 INFO L93 Difference]: Finished difference Result 2798 states and 4635 transitions. [2025-03-08 11:04:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:04:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-03-08 11:04:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:44,457 INFO L225 Difference]: With dead ends: 2798 [2025-03-08 11:04:44,457 INFO L226 Difference]: Without dead ends: 2067 [2025-03-08 11:04:44,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:04:44,460 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1099 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:44,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1502 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:04:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-03-08 11:04:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1429. [2025-03-08 11:04:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1011 states have (on average 1.5370919881305638) internal successors, (1554), 1018 states have internal predecessors, (1554), 409 states have call successors, (409), 8 states have call predecessors, (409), 8 states have return successors, (409), 402 states have call predecessors, (409), 409 states have call successors, (409) [2025-03-08 11:04:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2372 transitions. [2025-03-08 11:04:44,601 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2372 transitions. Word has length 500 [2025-03-08 11:04:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:44,601 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2372 transitions. [2025-03-08 11:04:44,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2372 transitions. [2025-03-08 11:04:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-08 11:04:44,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:44,619 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:44,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:04:44,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -967976161, now seen corresponding path program 1 times [2025-03-08 11:04:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401113457] [2025-03-08 11:04:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:44,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-08 11:04:44,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-08 11:04:44,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:44,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:44,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401113457] [2025-03-08 11:04:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401113457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:04:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655276053] [2025-03-08 11:04:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:04:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:44,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:04:44,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:44,784 INFO L87 Difference]: Start difference. First operand 1429 states and 2372 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:44,945 INFO L93 Difference]: Finished difference Result 3939 states and 6510 transitions. [2025-03-08 11:04:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:04:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-03-08 11:04:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:44,961 INFO L225 Difference]: With dead ends: 3939 [2025-03-08 11:04:44,961 INFO L226 Difference]: Without dead ends: 2513 [2025-03-08 11:04:44,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:44,966 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 274 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:44,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 979 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:04:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-08 11:04:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2509. [2025-03-08 11:04:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1723 states have (on average 1.4973882762623332) internal successors, (2580), 1738 states have internal predecessors, (2580), 769 states have call successors, (769), 16 states have call predecessors, (769), 16 states have return successors, (769), 754 states have call predecessors, (769), 769 states have call successors, (769) [2025-03-08 11:04:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 4118 transitions. [2025-03-08 11:04:45,114 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 4118 transitions. Word has length 501 [2025-03-08 11:04:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:45,116 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 4118 transitions. [2025-03-08 11:04:45,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 4118 transitions. [2025-03-08 11:04:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-08 11:04:45,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:45,123 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:45,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:04:45,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -956660034, now seen corresponding path program 1 times [2025-03-08 11:04:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861248947] [2025-03-08 11:04:45,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:45,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-08 11:04:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-08 11:04:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:45,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861248947] [2025-03-08 11:04:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861248947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:04:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673973463] [2025-03-08 11:04:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:45,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:04:45,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:45,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:04:45,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:45,285 INFO L87 Difference]: Start difference. First operand 2509 states and 4118 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:45,461 INFO L93 Difference]: Finished difference Result 5203 states and 8560 transitions. [2025-03-08 11:04:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:04:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-03-08 11:04:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:45,478 INFO L225 Difference]: With dead ends: 5203 [2025-03-08 11:04:45,479 INFO L226 Difference]: Without dead ends: 2697 [2025-03-08 11:04:45,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:45,485 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 285 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:45,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 891 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:04:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-08 11:04:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1851. [2025-03-08 11:04:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1431 states have (on average 1.5737246680642907) internal successors, (2252), 1438 states have internal predecessors, (2252), 409 states have call successors, (409), 10 states have call predecessors, (409), 10 states have return successors, (409), 402 states have call predecessors, (409), 409 states have call successors, (409) [2025-03-08 11:04:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 3070 transitions. [2025-03-08 11:04:45,600 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 3070 transitions. Word has length 501 [2025-03-08 11:04:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 3070 transitions. [2025-03-08 11:04:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3070 transitions. [2025-03-08 11:04:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-08 11:04:45,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:45,607 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:45,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:04:45,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:45,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash 943440449, now seen corresponding path program 1 times [2025-03-08 11:04:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593030294] [2025-03-08 11:04:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:45,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-08 11:04:45,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-08 11:04:45,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:45,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:46,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593030294] [2025-03-08 11:04:46,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593030294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:46,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:04:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209385325] [2025-03-08 11:04:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:46,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:04:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:46,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:04:46,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:04:46,130 INFO L87 Difference]: Start difference. First operand 1851 states and 3070 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:46,729 INFO L93 Difference]: Finished difference Result 5241 states and 8676 transitions. [2025-03-08 11:04:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:04:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-03-08 11:04:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:46,750 INFO L225 Difference]: With dead ends: 5241 [2025-03-08 11:04:46,751 INFO L226 Difference]: Without dead ends: 3393 [2025-03-08 11:04:46,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:04:46,757 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 570 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:46,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 799 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:04:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2025-03-08 11:04:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3383. [2025-03-08 11:04:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 2659 states have (on average 1.5697630688228656) internal successors, (4174), 2674 states have internal predecessors, (4174), 705 states have call successors, (705), 18 states have call predecessors, (705), 18 states have return successors, (705), 690 states have call predecessors, (705), 705 states have call successors, (705) [2025-03-08 11:04:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5584 transitions. [2025-03-08 11:04:46,947 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5584 transitions. Word has length 501 [2025-03-08 11:04:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:46,947 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 5584 transitions. [2025-03-08 11:04:46,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5584 transitions. [2025-03-08 11:04:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-08 11:04:46,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:46,953 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:04:46,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:46,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1758767122, now seen corresponding path program 1 times [2025-03-08 11:04:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113220789] [2025-03-08 11:04:46,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:46,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:04:46,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:04:47,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:47,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:47,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113220789] [2025-03-08 11:04:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113220789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:04:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231950856] [2025-03-08 11:04:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:04:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:47,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:04:47,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:04:47,208 INFO L87 Difference]: Start difference. First operand 3383 states and 5584 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:48,166 INFO L93 Difference]: Finished difference Result 13005 states and 21442 transitions. [2025-03-08 11:04:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:04:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-03-08 11:04:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:48,210 INFO L225 Difference]: With dead ends: 13005 [2025-03-08 11:04:48,210 INFO L226 Difference]: Without dead ends: 9625 [2025-03-08 11:04:48,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:04:48,221 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 924 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:48,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1540 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:04:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2025-03-08 11:04:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 6095. [2025-03-08 11:04:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 4796 states have (on average 1.5698498748957463) internal successors, (7529), 4822 states have internal predecessors, (7529), 1262 states have call successors, (1262), 36 states have call predecessors, (1262), 36 states have return successors, (1262), 1236 states have call predecessors, (1262), 1262 states have call successors, (1262) [2025-03-08 11:04:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 10053 transitions. [2025-03-08 11:04:48,556 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 10053 transitions. Word has length 503 [2025-03-08 11:04:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 10053 transitions. [2025-03-08 11:04:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 10053 transitions. [2025-03-08 11:04:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-08 11:04:48,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:48,567 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:48,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:04:48,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:48,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash 835459695, now seen corresponding path program 1 times [2025-03-08 11:04:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:48,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037188356] [2025-03-08 11:04:48,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:04:48,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:04:48,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:48,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-08 11:04:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037188356] [2025-03-08 11:04:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037188356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:49,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:04:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972154099] [2025-03-08 11:04:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:49,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:04:49,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:49,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:04:49,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:04:49,675 INFO L87 Difference]: Start difference. First operand 6095 states and 10053 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:51,534 INFO L93 Difference]: Finished difference Result 26107 states and 42937 transitions. [2025-03-08 11:04:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:04:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-03-08 11:04:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:51,600 INFO L225 Difference]: With dead ends: 26107 [2025-03-08 11:04:51,601 INFO L226 Difference]: Without dead ends: 20015 [2025-03-08 11:04:51,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:04:51,621 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 886 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:51,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1950 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:04:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20015 states. [2025-03-08 11:04:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20015 to 19943. [2025-03-08 11:04:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19943 states, 15604 states have (on average 1.559728274801333) internal successors, (24338), 15714 states have internal predecessors, (24338), 4210 states have call successors, (4210), 128 states have call predecessors, (4210), 128 states have return successors, (4210), 4100 states have call predecessors, (4210), 4210 states have call successors, (4210) [2025-03-08 11:04:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19943 states to 19943 states and 32758 transitions. [2025-03-08 11:04:52,924 INFO L78 Accepts]: Start accepts. Automaton has 19943 states and 32758 transitions. Word has length 503 [2025-03-08 11:04:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:52,925 INFO L471 AbstractCegarLoop]: Abstraction has 19943 states and 32758 transitions. [2025-03-08 11:04:52,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-08 11:04:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19943 states and 32758 transitions. [2025-03-08 11:04:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-08 11:04:52,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:52,948 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:04:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:04:52,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -9012176, now seen corresponding path program 1 times [2025-03-08 11:04:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942859933] [2025-03-08 11:04:52,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:52,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:04:53,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:04:53,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:53,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 21 proven. 447 refuted. 0 times theorem prover too weak. 12172 trivial. 0 not checked. [2025-03-08 11:04:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942859933] [2025-03-08 11:04:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942859933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:04:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220296459] [2025-03-08 11:04:54,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:04:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:04:54,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:04:54,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:04:54,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:04:54,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:04:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:54,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:54,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 11:04:54,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:04:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 1373 proven. 447 refuted. 0 times theorem prover too weak. 10820 trivial. 0 not checked. [2025-03-08 11:04:56,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:04:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 21 proven. 450 refuted. 0 times theorem prover too weak. 12169 trivial. 0 not checked. [2025-03-08 11:04:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220296459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:04:57,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:04:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2025-03-08 11:04:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334657858] [2025-03-08 11:04:57,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:04:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:04:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:04:57,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-08 11:04:57,055 INFO L87 Difference]: Start difference. First operand 19943 states and 32758 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-03-08 11:05:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:05:02,411 INFO L93 Difference]: Finished difference Result 88037 states and 139856 transitions. [2025-03-08 11:05:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 11:05:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) Word has length 503 [2025-03-08 11:05:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:05:02,633 INFO L225 Difference]: With dead ends: 88037 [2025-03-08 11:05:02,633 INFO L226 Difference]: Without dead ends: 68097 [2025-03-08 11:05:02,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1003 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=706, Invalid=1844, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 11:05:02,696 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1612 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:05:02,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3427 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:05:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68097 states. [2025-03-08 11:05:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68097 to 45257. [2025-03-08 11:05:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45257 states, 35796 states have (on average 1.5098893731143144) internal successors, (54048), 36128 states have internal predecessors, (54048), 8644 states have call successors, (8644), 816 states have call predecessors, (8644), 816 states have return successors, (8644), 8312 states have call predecessors, (8644), 8644 states have call successors, (8644) [2025-03-08 11:05:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45257 states to 45257 states and 71336 transitions. [2025-03-08 11:05:06,422 INFO L78 Accepts]: Start accepts. Automaton has 45257 states and 71336 transitions. Word has length 503 [2025-03-08 11:05:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:05:06,423 INFO L471 AbstractCegarLoop]: Abstraction has 45257 states and 71336 transitions. [2025-03-08 11:05:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-03-08 11:05:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 45257 states and 71336 transitions. [2025-03-08 11:05:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-08 11:05:06,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:05:06,453 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:05:06,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:05:06,654 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,SelfDestructingSolverStorable9 [2025-03-08 11:05:06,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:05:06,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:05:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash -514570801, now seen corresponding path program 1 times [2025-03-08 11:05:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:05:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622467541] [2025-03-08 11:05:06,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:05:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:05:06,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:05:06,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:05:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:05:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:05:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 387 proven. 81 refuted. 0 times theorem prover too weak. 12172 trivial. 0 not checked. [2025-03-08 11:05:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:05:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622467541] [2025-03-08 11:05:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622467541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:05:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244906714] [2025-03-08 11:05:09,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:05:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:05:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:05:09,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:05:09,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:05:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-08 11:05:10,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-08 11:05:10,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:05:10,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:05:10,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 11:05:10,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:05:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5125 proven. 516 refuted. 0 times theorem prover too weak. 6999 trivial. 0 not checked. [2025-03-08 11:05:16,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:05:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244906714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:05:29,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:05:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 42 [2025-03-08 11:05:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190044847] [2025-03-08 11:05:29,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:05:29,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 11:05:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:05:29,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 11:05:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2828, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 11:05:29,422 INFO L87 Difference]: Start difference. First operand 45257 states and 71336 transitions. Second operand has 42 states, 42 states have (on average 5.0476190476190474) internal successors, (212), 41 states have internal predecessors, (212), 7 states have call successors, (160), 6 states have call predecessors, (160), 11 states have return successors, (160), 8 states have call predecessors, (160), 7 states have call successors, (160)