./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01c992e168948c865774d6071204a719c87c2df20b1fe8dee696318794ef867b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:44:46,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:44:46,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:44:46,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:44:46,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:44:46,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:44:46,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:44:46,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:44:46,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:44:46,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:44:46,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:44:46,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:44:46,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:44:46,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:44:46,122 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:44:46,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:44:46,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:44:46,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:46,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:44:46,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:44:46,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:44:46,125 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 -> 01c992e168948c865774d6071204a719c87c2df20b1fe8dee696318794ef867b [2025-03-08 15:44:46,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:44:46,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:44:46,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:44:46,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:44:46,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:44:46,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i [2025-03-08 15:44:47,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa541ead0/f62e003e1e124c578f83ddc70addda7e/FLAG66214737f [2025-03-08 15:44:47,777 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:44:47,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i [2025-03-08 15:44:47,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa541ead0/f62e003e1e124c578f83ddc70addda7e/FLAG66214737f [2025-03-08 15:44:47,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa541ead0/f62e003e1e124c578f83ddc70addda7e [2025-03-08 15:44:47,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:44:47,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:44:47,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:47,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:44:47,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:44:47,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:47" (1/1) ... [2025-03-08 15:44:47,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a864e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:47, skipping insertion in model container [2025-03-08 15:44:47,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:44:47" (1/1) ... [2025-03-08 15:44:47,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:44:47,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i[916,929] [2025-03-08 15:44:48,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:48,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:44:48,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-51.i[916,929] [2025-03-08 15:44:48,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:44:48,192 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:44:48,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48 WrapperNode [2025-03-08 15:44:48,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:44:48,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:48,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:44:48,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:44:48,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,309 INFO L138 Inliner]: procedures = 26, calls = 100, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 703 [2025-03-08 15:44:48,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:44:48,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:44:48,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:44:48,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:44:48,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,418 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:44:48,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:44:48,498 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:44:48,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:44:48,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:44:48,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (1/1) ... [2025-03-08 15:44:48,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:44:48,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:48,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:44:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:44:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:44:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:44:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:44:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:44:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:44:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:44:48,651 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:44:48,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:44:49,493 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc property_#t~bitwise57#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~bitwise61#1;havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short64#1; [2025-03-08 15:44:49,608 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-08 15:44:49,608 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:44:49,649 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:44:49,649 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:44:49,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:49 BoogieIcfgContainer [2025-03-08 15:44:49,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:44:49,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:44:49,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:44:49,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:44:49,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:44:47" (1/3) ... [2025-03-08 15:44:49,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4321bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:49, skipping insertion in model container [2025-03-08 15:44:49,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:44:48" (2/3) ... [2025-03-08 15:44:49,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4321bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:44:49, skipping insertion in model container [2025-03-08 15:44:49,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:44:49" (3/3) ... [2025-03-08 15:44:49,660 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-51.i [2025-03-08 15:44:49,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:44:49,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-51.i that has 2 procedures, 290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:44:49,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:44:49,732 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;@3f8e3b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:44:49,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:44:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 290 states, 200 states have (on average 1.555) internal successors, (311), 201 states have internal predecessors, (311), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 15:44:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-08 15:44:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:49,765 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:49,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 990434052, now seen corresponding path program 1 times [2025-03-08 15:44:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143524458] [2025-03-08 15:44:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:49,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-08 15:44:49,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-08 15:44:49,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:49,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-08 15:44:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:50,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143524458] [2025-03-08 15:44:50,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143524458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950890763] [2025-03-08 15:44:50,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:50,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:50,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:50,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:50,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:44:50,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-08 15:44:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-08 15:44:50,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:50,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:50,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:44:50,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-08 15:44:50,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:44:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950890763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:44:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:44:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980421308] [2025-03-08 15:44:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:44:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:50,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:44:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:44:50,907 INFO L87 Difference]: Start difference. First operand has 290 states, 200 states have (on average 1.555) internal successors, (311), 201 states have internal predecessors, (311), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-08 15:44:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:50,984 INFO L93 Difference]: Finished difference Result 574 states and 1052 transitions. [2025-03-08 15:44:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:44:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) Word has length 567 [2025-03-08 15:44:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:50,995 INFO L225 Difference]: With dead ends: 574 [2025-03-08 15:44:50,995 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 15:44:50,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:44:51,001 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:51,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 15:44:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-08 15:44:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 198 states have internal predecessors, (306), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 15:44:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2025-03-08 15:44:51,077 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 567 [2025-03-08 15:44:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2025-03-08 15:44:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-08 15:44:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2025-03-08 15:44:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-08 15:44:51,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:51,092 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:51,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:44:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:44:51,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:51,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1913873315, now seen corresponding path program 1 times [2025-03-08 15:44:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697150616] [2025-03-08 15:44:51,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:51,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-03-08 15:44:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-03-08 15:44:51,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:51,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697150616] [2025-03-08 15:44:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697150616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:51,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465872703] [2025-03-08 15:44:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:51,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:51,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:51,945 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:52,057 INFO L93 Difference]: Finished difference Result 767 states and 1284 transitions. [2025-03-08 15:44:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 567 [2025-03-08 15:44:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:52,067 INFO L225 Difference]: With dead ends: 767 [2025-03-08 15:44:52,067 INFO L226 Difference]: Without dead ends: 483 [2025-03-08 15:44:52,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:52,069 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 317 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:52,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1043 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-08 15:44:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 480. [2025-03-08 15:44:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 344 states have (on average 1.563953488372093) internal successors, (538), 345 states have internal predecessors, (538), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-08 15:44:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 804 transitions. [2025-03-08 15:44:52,134 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 804 transitions. Word has length 567 [2025-03-08 15:44:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:52,135 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 804 transitions. [2025-03-08 15:44:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 804 transitions. [2025-03-08 15:44:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:52,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:52,144 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:44:52,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash -614790253, now seen corresponding path program 1 times [2025-03-08 15:44:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570546690] [2025-03-08 15:44:52,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:52,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:52,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:52,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:52,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:52,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570546690] [2025-03-08 15:44:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570546690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712704307] [2025-03-08 15:44:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:52,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:52,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:52,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:52,692 INFO L87 Difference]: Start difference. First operand 480 states and 804 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:52,829 INFO L93 Difference]: Finished difference Result 1428 states and 2394 transitions. [2025-03-08 15:44:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:52,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-03-08 15:44:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:52,842 INFO L225 Difference]: With dead ends: 1428 [2025-03-08 15:44:52,842 INFO L226 Difference]: Without dead ends: 951 [2025-03-08 15:44:52,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:52,844 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 441 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:52,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1078 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-08 15:44:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-03-08 15:44:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 678 states have (on average 1.556047197640118) internal successors, (1055), 680 states have internal predecessors, (1055), 266 states have call successors, (266), 4 states have call predecessors, (266), 4 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-08 15:44:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1587 transitions. [2025-03-08 15:44:53,010 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1587 transitions. Word has length 568 [2025-03-08 15:44:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1587 transitions. [2025-03-08 15:44:53,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1587 transitions. [2025-03-08 15:44:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:53,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:53,018 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:53,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:44:53,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -195273422, now seen corresponding path program 1 times [2025-03-08 15:44:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415448415] [2025-03-08 15:44:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:53,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:53,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:53,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:53,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415448415] [2025-03-08 15:44:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415448415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490592067] [2025-03-08 15:44:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:53,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:53,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:53,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:53,280 INFO L87 Difference]: Start difference. First operand 949 states and 1587 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:53,404 INFO L93 Difference]: Finished difference Result 2825 states and 4723 transitions. [2025-03-08 15:44:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-03-08 15:44:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:53,417 INFO L225 Difference]: With dead ends: 2825 [2025-03-08 15:44:53,417 INFO L226 Difference]: Without dead ends: 1879 [2025-03-08 15:44:53,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:53,421 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 438 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:53,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 925 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-03-08 15:44:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1201. [2025-03-08 15:44:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 930 states have (on average 1.6096774193548387) internal successors, (1497), 932 states have internal predecessors, (1497), 266 states have call successors, (266), 4 states have call predecessors, (266), 4 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-08 15:44:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2029 transitions. [2025-03-08 15:44:53,576 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2029 transitions. Word has length 568 [2025-03-08 15:44:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:53,577 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2029 transitions. [2025-03-08 15:44:53,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2029 transitions. [2025-03-08 15:44:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:53,586 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:53,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:44:53,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:53,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash -94086894, now seen corresponding path program 1 times [2025-03-08 15:44:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639537945] [2025-03-08 15:44:53,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:53,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:53,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639537945] [2025-03-08 15:44:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639537945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638051305] [2025-03-08 15:44:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:53,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:53,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:53,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:53,842 INFO L87 Difference]: Start difference. First operand 1201 states and 2029 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:54,023 INFO L93 Difference]: Finished difference Result 3529 states and 5951 transitions. [2025-03-08 15:44:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:54,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-03-08 15:44:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:54,035 INFO L225 Difference]: With dead ends: 3529 [2025-03-08 15:44:54,035 INFO L226 Difference]: Without dead ends: 2331 [2025-03-08 15:44:54,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:54,040 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 400 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:54,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 916 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-03-08 15:44:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1721. [2025-03-08 15:44:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1450 states have (on average 1.6613793103448276) internal successors, (2409), 1452 states have internal predecessors, (2409), 266 states have call successors, (266), 4 states have call predecessors, (266), 4 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-08 15:44:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2941 transitions. [2025-03-08 15:44:54,185 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2941 transitions. Word has length 568 [2025-03-08 15:44:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:54,186 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2941 transitions. [2025-03-08 15:44:54,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2941 transitions. [2025-03-08 15:44:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:54,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:54,191 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:54,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:44:54,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1413464915, now seen corresponding path program 1 times [2025-03-08 15:44:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:54,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266106851] [2025-03-08 15:44:54,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:54,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:54,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:54,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266106851] [2025-03-08 15:44:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266106851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:54,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375634221] [2025-03-08 15:44:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:54,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:54,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:54,937 INFO L87 Difference]: Start difference. First operand 1721 states and 2941 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:55,094 INFO L93 Difference]: Finished difference Result 5023 states and 8594 transitions. [2025-03-08 15:44:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:55,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-03-08 15:44:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:55,113 INFO L225 Difference]: With dead ends: 5023 [2025-03-08 15:44:55,113 INFO L226 Difference]: Without dead ends: 3305 [2025-03-08 15:44:55,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:55,119 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 319 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:55,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1006 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-03-08 15:44:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3301. [2025-03-08 15:44:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2760 states have (on average 1.6608695652173913) internal successors, (4584), 2764 states have internal predecessors, (4584), 532 states have call successors, (532), 8 states have call predecessors, (532), 8 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-03-08 15:44:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 5648 transitions. [2025-03-08 15:44:55,311 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 5648 transitions. Word has length 568 [2025-03-08 15:44:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 5648 transitions. [2025-03-08 15:44:55,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 5648 transitions. [2025-03-08 15:44:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:55,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:55,318 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:55,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:44:55,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 246768596, now seen corresponding path program 1 times [2025-03-08 15:44:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056762577] [2025-03-08 15:44:55,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:55,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:55,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:55,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056762577] [2025-03-08 15:44:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056762577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842929743] [2025-03-08 15:44:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:55,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:55,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:55,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:55,920 INFO L87 Difference]: Start difference. First operand 3301 states and 5648 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:56,197 INFO L93 Difference]: Finished difference Result 9897 states and 16938 transitions. [2025-03-08 15:44:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:56,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 568 [2025-03-08 15:44:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:56,230 INFO L225 Difference]: With dead ends: 9897 [2025-03-08 15:44:56,230 INFO L226 Difference]: Without dead ends: 6599 [2025-03-08 15:44:56,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:56,240 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 300 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:56,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 933 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2025-03-08 15:44:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6597. [2025-03-08 15:44:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 5516 states have (on average 1.6555474981870921) internal successors, (9132), 5524 states have internal predecessors, (9132), 1064 states have call successors, (1064), 16 states have call predecessors, (1064), 16 states have return successors, (1064), 1056 states have call predecessors, (1064), 1064 states have call successors, (1064) [2025-03-08 15:44:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 11260 transitions. [2025-03-08 15:44:56,652 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 11260 transitions. Word has length 568 [2025-03-08 15:44:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:56,654 INFO L471 AbstractCegarLoop]: Abstraction has 6597 states and 11260 transitions. [2025-03-08 15:44:56,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:44:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 11260 transitions. [2025-03-08 15:44:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 15:44:56,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:56,666 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:44:56,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 370841843, now seen corresponding path program 1 times [2025-03-08 15:44:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538070611] [2025-03-08 15:44:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:56,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 15:44:56,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 15:44:56,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538070611] [2025-03-08 15:44:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538070611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046424134] [2025-03-08 15:44:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:57,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:57,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:57,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:57,380 INFO L87 Difference]: Start difference. First operand 6597 states and 11260 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-08 15:44:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:58,226 INFO L93 Difference]: Finished difference Result 16099 states and 27551 transitions. [2025-03-08 15:44:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:58,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 568 [2025-03-08 15:44:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:58,282 INFO L225 Difference]: With dead ends: 16099 [2025-03-08 15:44:58,282 INFO L226 Difference]: Without dead ends: 9505 [2025-03-08 15:44:58,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:44:58,302 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 434 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:58,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2064 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:44:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9505 states. [2025-03-08 15:44:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9505 to 7363. [2025-03-08 15:44:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7363 states, 6194 states have (on average 1.6524055537617048) internal successors, (10235), 6202 states have internal predecessors, (10235), 1151 states have call successors, (1151), 17 states have call predecessors, (1151), 17 states have return successors, (1151), 1143 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-08 15:44:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 12537 transitions. [2025-03-08 15:44:58,733 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 12537 transitions. Word has length 568 [2025-03-08 15:44:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:58,734 INFO L471 AbstractCegarLoop]: Abstraction has 7363 states and 12537 transitions. [2025-03-08 15:44:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-08 15:44:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 12537 transitions. [2025-03-08 15:44:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 15:44:58,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:58,742 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:58,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:44:58,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash 774274488, now seen corresponding path program 1 times [2025-03-08 15:44:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88671060] [2025-03-08 15:44:58,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:58,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 15:44:59,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 15:44:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:44:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:59,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88671060] [2025-03-08 15:44:59,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88671060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:59,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:59,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437635192] [2025-03-08 15:44:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:59,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:59,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:59,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:00,000 INFO L87 Difference]: Start difference. First operand 7363 states and 12537 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:00,796 INFO L93 Difference]: Finished difference Result 20889 states and 35544 transitions. [2025-03-08 15:45:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:00,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 569 [2025-03-08 15:45:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:00,844 INFO L225 Difference]: With dead ends: 20889 [2025-03-08 15:45:00,844 INFO L226 Difference]: Without dead ends: 14119 [2025-03-08 15:45:00,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:00,862 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 749 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:00,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1700 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:45:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14119 states. [2025-03-08 15:45:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14119 to 14099. [2025-03-08 15:45:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 12010 states have (on average 1.638218151540383) internal successors, (19675), 12034 states have internal predecessors, (19675), 2047 states have call successors, (2047), 41 states have call predecessors, (2047), 41 states have return successors, (2047), 2023 states have call predecessors, (2047), 2047 states have call successors, (2047) [2025-03-08 15:45:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 23769 transitions. [2025-03-08 15:45:01,468 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 23769 transitions. Word has length 569 [2025-03-08 15:45:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:01,469 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 23769 transitions. [2025-03-08 15:45:01,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 23769 transitions. [2025-03-08 15:45:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-08 15:45:01,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:01,480 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:01,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:45:01,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash -481694794, now seen corresponding path program 1 times [2025-03-08 15:45:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966964856] [2025-03-08 15:45:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:01,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 15:45:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 15:45:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 18 proven. 240 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966964856] [2025-03-08 15:45:03,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966964856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:03,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233926669] [2025-03-08 15:45:03,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:03,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:03,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:45:03,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-08 15:45:04,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-08 15:45:04,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:04,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:45:04,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 5018 proven. 204 refuted. 0 times theorem prover too weak. 9742 trivial. 0 not checked. [2025-03-08 15:45:04,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 54 proven. 204 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233926669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:05,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-08 15:45:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63490858] [2025-03-08 15:45:05,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:05,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:45:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:05,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:45:05,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:45:05,552 INFO L87 Difference]: Start difference. First operand 14099 states and 23769 transitions. Second operand has 17 states, 16 states have (on average 20.9375) internal successors, (335), 17 states have internal predecessors, (335), 6 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 6 states have call successors, (243) [2025-03-08 15:45:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:07,953 INFO L93 Difference]: Finished difference Result 48751 states and 82190 transitions. [2025-03-08 15:45:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 15:45:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 20.9375) internal successors, (335), 17 states have internal predecessors, (335), 6 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 6 states have call successors, (243) Word has length 569 [2025-03-08 15:45:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:08,061 INFO L225 Difference]: With dead ends: 48751 [2025-03-08 15:45:08,062 INFO L226 Difference]: Without dead ends: 34813 [2025-03-08 15:45:08,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 15:45:08,106 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 6853 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6872 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:08,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6872 Valid, 2325 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:45:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34813 states. [2025-03-08 15:45:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34813 to 33827. [2025-03-08 15:45:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33827 states, 30871 states have (on average 1.6647338926500599) internal successors, (51392), 30927 states have internal predecessors, (51392), 2815 states have call successors, (2815), 140 states have call predecessors, (2815), 140 states have return successors, (2815), 2759 states have call predecessors, (2815), 2815 states have call successors, (2815) [2025-03-08 15:45:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33827 states to 33827 states and 57022 transitions. [2025-03-08 15:45:09,197 INFO L78 Accepts]: Start accepts. Automaton has 33827 states and 57022 transitions. Word has length 569 [2025-03-08 15:45:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 33827 states and 57022 transitions. [2025-03-08 15:45:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 20.9375) internal successors, (335), 17 states have internal predecessors, (335), 6 states have call successors, (242), 2 states have call predecessors, (242), 4 states have return successors, (243), 5 states have call predecessors, (243), 6 states have call successors, (243) [2025-03-08 15:45:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33827 states and 57022 transitions. [2025-03-08 15:45:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-08 15:45:09,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:09,219 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:09,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:45:09,423 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 15:45:09,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:09,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1299176015, now seen corresponding path program 1 times [2025-03-08 15:45:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330620799] [2025-03-08 15:45:09,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:09,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-08 15:45:09,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-08 15:45:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:45:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330620799] [2025-03-08 15:45:09,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330620799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:09,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:09,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092784497] [2025-03-08 15:45:09,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:09,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:09,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:09,604 INFO L87 Difference]: Start difference. First operand 33827 states and 57022 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:10,440 INFO L93 Difference]: Finished difference Result 72491 states and 120924 transitions. [2025-03-08 15:45:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 570 [2025-03-08 15:45:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:10,591 INFO L225 Difference]: With dead ends: 72491 [2025-03-08 15:45:10,591 INFO L226 Difference]: Without dead ends: 43707 [2025-03-08 15:45:10,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:10,646 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 430 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:10,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1341 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43707 states. [2025-03-08 15:45:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43707 to 33827. [2025-03-08 15:45:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33827 states, 30871 states have (on average 1.653849891483917) internal successors, (51056), 30927 states have internal predecessors, (51056), 2815 states have call successors, (2815), 140 states have call predecessors, (2815), 140 states have return successors, (2815), 2759 states have call predecessors, (2815), 2815 states have call successors, (2815) [2025-03-08 15:45:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33827 states to 33827 states and 56686 transitions. [2025-03-08 15:45:12,063 INFO L78 Accepts]: Start accepts. Automaton has 33827 states and 56686 transitions. Word has length 570 [2025-03-08 15:45:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 33827 states and 56686 transitions. [2025-03-08 15:45:12,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 33827 states and 56686 transitions. [2025-03-08 15:45:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 15:45:12,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:12,088 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:45:12,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -928062400, now seen corresponding path program 1 times [2025-03-08 15:45:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016455234] [2025-03-08 15:45:12,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:12,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:45:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016455234] [2025-03-08 15:45:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016455234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:45:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745877817] [2025-03-08 15:45:13,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:45:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:13,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:45:13,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:13,170 INFO L87 Difference]: Start difference. First operand 33827 states and 56686 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:15,374 INFO L93 Difference]: Finished difference Result 114388 states and 190823 transitions. [2025-03-08 15:45:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:45:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-03-08 15:45:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:15,530 INFO L225 Difference]: With dead ends: 114388 [2025-03-08 15:45:15,530 INFO L226 Difference]: Without dead ends: 77518 [2025-03-08 15:45:15,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:45:15,570 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 2404 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 5466 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:15,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 5466 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:45:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77518 states. [2025-03-08 15:45:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77518 to 40116. [2025-03-08 15:45:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40116 states, 38013 states have (on average 1.661405308710178) internal successors, (63155), 38043 states have internal predecessors, (63155), 1997 states have call successors, (1997), 105 states have call predecessors, (1997), 105 states have return successors, (1997), 1967 states have call predecessors, (1997), 1997 states have call successors, (1997) [2025-03-08 15:45:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40116 states to 40116 states and 67149 transitions. [2025-03-08 15:45:17,234 INFO L78 Accepts]: Start accepts. Automaton has 40116 states and 67149 transitions. Word has length 571 [2025-03-08 15:45:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 40116 states and 67149 transitions. [2025-03-08 15:45:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 40116 states and 67149 transitions. [2025-03-08 15:45:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 15:45:17,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:17,257 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:17,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:45:17,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:17,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1339518015, now seen corresponding path program 1 times [2025-03-08 15:45:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395377096] [2025-03-08 15:45:17,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:17,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:17,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:17,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:45:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:17,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395377096] [2025-03-08 15:45:17,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395377096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:17,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634158171] [2025-03-08 15:45:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:17,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:17,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:17,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:17,974 INFO L87 Difference]: Start difference. First operand 40116 states and 67149 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:19,354 INFO L93 Difference]: Finished difference Result 84028 states and 139442 transitions. [2025-03-08 15:45:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:19,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-03-08 15:45:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:19,496 INFO L225 Difference]: With dead ends: 84028 [2025-03-08 15:45:19,496 INFO L226 Difference]: Without dead ends: 50882 [2025-03-08 15:45:19,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:19,532 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 898 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:19,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2349 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50882 states. [2025-03-08 15:45:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50882 to 34242. [2025-03-08 15:45:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34242 states, 32139 states have (on average 1.6487445160085876) internal successors, (52989), 32169 states have internal predecessors, (52989), 1997 states have call successors, (1997), 105 states have call predecessors, (1997), 105 states have return successors, (1997), 1967 states have call predecessors, (1997), 1997 states have call successors, (1997) [2025-03-08 15:45:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34242 states to 34242 states and 56983 transitions. [2025-03-08 15:45:20,806 INFO L78 Accepts]: Start accepts. Automaton has 34242 states and 56983 transitions. Word has length 571 [2025-03-08 15:45:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:20,807 INFO L471 AbstractCegarLoop]: Abstraction has 34242 states and 56983 transitions. [2025-03-08 15:45:20,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 34242 states and 56983 transitions. [2025-03-08 15:45:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 15:45:20,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:20,830 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:20,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:45:20,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:20,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -484450977, now seen corresponding path program 1 times [2025-03-08 15:45:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774671828] [2025-03-08 15:45:20,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:20,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:22,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:22,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:22,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 78 proven. 180 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774671828] [2025-03-08 15:45:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774671828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468955372] [2025-03-08 15:45:23,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:23,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:45:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:23,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:23,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:23,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:23,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:45:23,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 6812 proven. 87 refuted. 0 times theorem prover too weak. 8065 trivial. 0 not checked. [2025-03-08 15:45:23,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 171 proven. 87 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:24,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468955372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:24,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-08 15:45:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378633782] [2025-03-08 15:45:24,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:45:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:24,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:45:24,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:45:24,140 INFO L87 Difference]: Start difference. First operand 34242 states and 56983 transitions. Second operand has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 3 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (178), 3 states have call predecessors, (178), 3 states have call successors, (178) [2025-03-08 15:45:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:25,377 INFO L93 Difference]: Finished difference Result 48694 states and 80873 transitions. [2025-03-08 15:45:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:45:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 3 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (178), 3 states have call predecessors, (178), 3 states have call successors, (178) Word has length 571 [2025-03-08 15:45:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:25,428 INFO L225 Difference]: With dead ends: 48694 [2025-03-08 15:45:25,428 INFO L226 Difference]: Without dead ends: 19646 [2025-03-08 15:45:25,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1141 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:45:25,458 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 1070 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:25,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 1293 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:45:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2025-03-08 15:45:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 18764. [2025-03-08 15:45:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18764 states, 16949 states have (on average 1.6415717741459672) internal successors, (27823), 16979 states have internal predecessors, (27823), 1697 states have call successors, (1697), 117 states have call predecessors, (1697), 117 states have return successors, (1697), 1667 states have call predecessors, (1697), 1697 states have call successors, (1697) [2025-03-08 15:45:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18764 states to 18764 states and 31217 transitions. [2025-03-08 15:45:26,068 INFO L78 Accepts]: Start accepts. Automaton has 18764 states and 31217 transitions. Word has length 571 [2025-03-08 15:45:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 18764 states and 31217 transitions. [2025-03-08 15:45:26,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 3 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (178), 3 states have call predecessors, (178), 3 states have call successors, (178) [2025-03-08 15:45:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 18764 states and 31217 transitions. [2025-03-08 15:45:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 15:45:26,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:26,130 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:26,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:45:26,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:26,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1741949056, now seen corresponding path program 1 times [2025-03-08 15:45:26,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:26,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169619997] [2025-03-08 15:45:26,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:26,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-08 15:45:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:26,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169619997] [2025-03-08 15:45:26,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169619997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:26,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:26,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:45:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088970410] [2025-03-08 15:45:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:26,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:45:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:26,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:45:26,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:26,894 INFO L87 Difference]: Start difference. First operand 18764 states and 31217 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:27,474 INFO L93 Difference]: Finished difference Result 29170 states and 48429 transitions. [2025-03-08 15:45:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 571 [2025-03-08 15:45:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:27,516 INFO L225 Difference]: With dead ends: 29170 [2025-03-08 15:45:27,516 INFO L226 Difference]: Without dead ends: 14356 [2025-03-08 15:45:27,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:45:27,540 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 443 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:27,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1983 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14356 states. [2025-03-08 15:45:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14356 to 14354. [2025-03-08 15:45:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14354 states, 13052 states have (on average 1.6345387680049035) internal successors, (21334), 13073 states have internal predecessors, (21334), 1214 states have call successors, (1214), 87 states have call predecessors, (1214), 87 states have return successors, (1214), 1193 states have call predecessors, (1214), 1214 states have call successors, (1214) [2025-03-08 15:45:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14354 states to 14354 states and 23762 transitions. [2025-03-08 15:45:28,378 INFO L78 Accepts]: Start accepts. Automaton has 14354 states and 23762 transitions. Word has length 571 [2025-03-08 15:45:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:28,378 INFO L471 AbstractCegarLoop]: Abstraction has 14354 states and 23762 transitions. [2025-03-08 15:45:28,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-08 15:45:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14354 states and 23762 transitions. [2025-03-08 15:45:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-08 15:45:28,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:28,388 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:28,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:45:28,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:28,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash -416138205, now seen corresponding path program 1 times [2025-03-08 15:45:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250977010] [2025-03-08 15:45:28,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:28,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:29,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:29,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:29,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 114 proven. 144 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250977010] [2025-03-08 15:45:29,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250977010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052492620] [2025-03-08 15:45:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:29,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:29,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:45:30,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-08 15:45:30,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-08 15:45:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:30,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 15:45:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7262 proven. 102 refuted. 0 times theorem prover too weak. 7600 trivial. 0 not checked. [2025-03-08 15:45:31,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 156 proven. 102 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052492620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:31,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2025-03-08 15:45:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130224765] [2025-03-08 15:45:31,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:31,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:45:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:31,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:45:31,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:45:31,878 INFO L87 Difference]: Start difference. First operand 14354 states and 23762 transitions. Second operand has 19 states, 19 states have (on average 16.842105263157894) internal successors, (320), 19 states have internal predecessors, (320), 5 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (223), 5 states have call predecessors, (223), 5 states have call successors, (223) [2025-03-08 15:45:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:48,139 INFO L93 Difference]: Finished difference Result 94078 states and 151833 transitions. [2025-03-08 15:45:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2025-03-08 15:45:48,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 16.842105263157894) internal successors, (320), 19 states have internal predecessors, (320), 5 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (223), 5 states have call predecessors, (223), 5 states have call successors, (223) Word has length 571 [2025-03-08 15:45:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:48,318 INFO L225 Difference]: With dead ends: 94078 [2025-03-08 15:45:48,318 INFO L226 Difference]: Without dead ends: 80756 [2025-03-08 15:45:48,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1375 GetRequests, 1155 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22376 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6430, Invalid=42632, Unknown=0, NotChecked=0, Total=49062 [2025-03-08 15:45:48,360 INFO L435 NwaCegarLoop]: 2612 mSDtfsCounter, 6046 mSDsluCounter, 18715 mSDsCounter, 0 mSdLazyCounter, 13981 mSolverCounterSat, 3804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6089 SdHoareTripleChecker+Valid, 21327 SdHoareTripleChecker+Invalid, 17785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3804 IncrementalHoareTripleChecker+Valid, 13981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:48,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6089 Valid, 21327 Invalid, 17785 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3804 Valid, 13981 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-03-08 15:45:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80756 states. [2025-03-08 15:45:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80756 to 55532. [2025-03-08 15:45:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55532 states, 47112 states have (on average 1.5350229240957718) internal successors, (72318), 47312 states have internal predecessors, (72318), 7759 states have call successors, (7759), 660 states have call predecessors, (7759), 660 states have return successors, (7759), 7559 states have call predecessors, (7759), 7759 states have call successors, (7759) [2025-03-08 15:45:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55532 states to 55532 states and 87836 transitions. [2025-03-08 15:45:51,927 INFO L78 Accepts]: Start accepts. Automaton has 55532 states and 87836 transitions. Word has length 571 [2025-03-08 15:45:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 55532 states and 87836 transitions. [2025-03-08 15:45:51,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 16.842105263157894) internal successors, (320), 19 states have internal predecessors, (320), 5 states have call successors, (222), 3 states have call predecessors, (222), 6 states have return successors, (223), 5 states have call predecessors, (223), 5 states have call successors, (223) [2025-03-08 15:45:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55532 states and 87836 transitions. [2025-03-08 15:45:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-08 15:45:51,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:51,944 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:45:51,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:45:52,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:45:52,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash -562203577, now seen corresponding path program 1 times [2025-03-08 15:45:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81157831] [2025-03-08 15:45:52,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:52,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-08 15:45:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-08 15:45:54,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:54,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:54,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:54,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81157831] [2025-03-08 15:45:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81157831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:54,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757291182] [2025-03-08 15:45:54,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:54,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:54,630 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:45:54,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:45:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-08 15:45:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-08 15:45:54,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:54,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:54,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:45:54,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 3662 proven. 222 refuted. 0 times theorem prover too weak. 11080 trivial. 0 not checked. [2025-03-08 15:45:55,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:45:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-08 15:45:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757291182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:45:55,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:45:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-08 15:45:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267013307] [2025-03-08 15:45:55,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:45:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:45:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:45:55,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:45:55,875 INFO L87 Difference]: Start difference. First operand 55532 states and 87836 transitions. Second operand has 9 states, 9 states have (on average 36.333333333333336) internal successors, (327), 9 states have internal predecessors, (327), 4 states have call successors, (235), 2 states have call predecessors, (235), 4 states have return successors, (236), 4 states have call predecessors, (236), 4 states have call successors, (236)