./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_amount250_file-42.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 5e104cbbe92849db5f4f231224a2ac2d2f04205e465893be255099ba4190cda0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:21,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:21,221 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:21,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:21,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:21,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:21,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:21,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:21,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:21,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:21,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:21,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:21,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:21,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:21,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:21,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:21,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:21,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:21,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:21,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:21,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:21,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:21,257 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 -> 5e104cbbe92849db5f4f231224a2ac2d2f04205e465893be255099ba4190cda0 [2025-03-04 00:11:21,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:21,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:21,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:21,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:21,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:21,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i [2025-03-04 00:11:22,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0e7eabb/176650abdf0e4ce7b15e023b1ce4fb02/FLAG26ed0793b [2025-03-04 00:11:22,939 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:22,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-42.i [2025-03-04 00:11:22,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0e7eabb/176650abdf0e4ce7b15e023b1ce4fb02/FLAG26ed0793b [2025-03-04 00:11:23,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0e7eabb/176650abdf0e4ce7b15e023b1ce4fb02 [2025-03-04 00:11:23,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:23,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:23,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:23,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:23,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:23,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1478a754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23, skipping insertion in model container [2025-03-04 00:11:23,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:23,340 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_amount250_file-42.i[916,929] [2025-03-04 00:11:23,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:23,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:23,472 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_amount250_file-42.i[916,929] [2025-03-04 00:11:23,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:23,547 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:23,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23 WrapperNode [2025-03-04 00:11:23,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:23,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:23,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:23,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:23,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,606 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2025-03-04 00:11:23,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:23,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:23,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:23,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:23,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,645 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-04 00:11:23,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:23,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:23,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:23,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:23,681 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (1/1) ... [2025-03-04 00:11:23,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:23,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:23,708 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-04 00:11:23,714 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-04 00:11:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:23,800 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:23,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:24,331 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc property_#t~ite39#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short40#1;havoc property_#t~bitwise41#1;havoc property_#t~short42#1; [2025-03-04 00:11:24,380 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:24,381 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:24,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:24,407 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:11:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:24 BoogieIcfgContainer [2025-03-04 00:11:24,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:24,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:24,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:24,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:24,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:23" (1/3) ... [2025-03-04 00:11:24,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf4a9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:24, skipping insertion in model container [2025-03-04 00:11:24,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:23" (2/3) ... [2025-03-04 00:11:24,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf4a9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:24, skipping insertion in model container [2025-03-04 00:11:24,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:24" (3/3) ... [2025-03-04 00:11:24,415 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-42.i [2025-03-04 00:11:24,426 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:24,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-42.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:24,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:24,486 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;@36731897, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:24,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 128 states have (on average 1.53125) internal successors, (196), 129 states have internal predecessors, (196), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:11:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:11:24,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:24,533 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:24,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:24,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1195039003, now seen corresponding path program 1 times [2025-03-04 00:11:24,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:24,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708671976] [2025-03-04 00:11:24,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:24,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:11:24,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:11:24,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:24,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:11:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708671976] [2025-03-04 00:11:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708671976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444183853] [2025-03-04 00:11:24,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:24,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:24,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:24,935 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-04 00:11:24,937 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-04 00:11:25,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:11:25,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:11:25,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:25,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:25,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:11:25,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:11:25,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444183853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:25,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:25,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:11:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127765736] [2025-03-04 00:11:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:25,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:11:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:25,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:11:25,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:11:25,203 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.53125) internal successors, (196), 129 states have internal predecessors, (196), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:11:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:25,250 INFO L93 Difference]: Finished difference Result 342 states and 602 transitions. [2025-03-04 00:11:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:11:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2025-03-04 00:11:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:25,260 INFO L225 Difference]: With dead ends: 342 [2025-03-04 00:11:25,260 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 00:11:25,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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-04 00:11:25,269 INFO L435 NwaCegarLoop]: 266 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, 266 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-04 00:11:25,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 00:11:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-04 00:11:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.492063492063492) internal successors, (188), 126 states have internal predecessors, (188), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:11:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 274 transitions. [2025-03-04 00:11:25,317 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 274 transitions. Word has length 285 [2025-03-04 00:11:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:25,317 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 274 transitions. [2025-03-04 00:11:25,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:11:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 274 transitions. [2025-03-04 00:11:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 00:11:25,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:25,323 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:25,330 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-04 00:11:25,523 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-04 00:11:25,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:25,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -29747522, now seen corresponding path program 1 times [2025-03-04 00:11:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825281009] [2025-03-04 00:11:25,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:25,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 00:11:25,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 00:11:25,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:25,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:26,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825281009] [2025-03-04 00:11:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825281009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:26,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:26,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498355735] [2025-03-04 00:11:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:26,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:26,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:26,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:26,147 INFO L87 Difference]: Start difference. First operand 171 states and 274 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:26,417 INFO L93 Difference]: Finished difference Result 508 states and 817 transitions. [2025-03-04 00:11:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 286 [2025-03-04 00:11:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:26,423 INFO L225 Difference]: With dead ends: 508 [2025-03-04 00:11:26,423 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 00:11:26,424 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-04 00:11:26,424 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 186 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:26,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 773 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 00:11:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 258. [2025-03-04 00:11:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:11:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 412 transitions. [2025-03-04 00:11:26,458 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 412 transitions. Word has length 286 [2025-03-04 00:11:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:26,458 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 412 transitions. [2025-03-04 00:11:26,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 412 transitions. [2025-03-04 00:11:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-04 00:11:26,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:26,461 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:26,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:11:26,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:26,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -38757568, now seen corresponding path program 1 times [2025-03-04 00:11:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:26,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699909619] [2025-03-04 00:11:26,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:26,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-04 00:11:26,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-04 00:11:26,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:27,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699909619] [2025-03-04 00:11:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699909619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:27,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:27,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:11:27,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364455125] [2025-03-04 00:11:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:27,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:11:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:27,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:11:27,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:11:27,036 INFO L87 Difference]: Start difference. First operand 258 states and 412 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:27,450 INFO L93 Difference]: Finished difference Result 595 states and 955 transitions. [2025-03-04 00:11:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:11:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-03-04 00:11:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:27,454 INFO L225 Difference]: With dead ends: 595 [2025-03-04 00:11:27,454 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 00:11:27,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:11:27,455 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 259 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:27,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1039 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:11:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 00:11:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 267. [2025-03-04 00:11:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 178 states have (on average 1.4325842696629214) internal successors, (255), 178 states have internal predecessors, (255), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:11:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 427 transitions. [2025-03-04 00:11:27,492 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 427 transitions. Word has length 288 [2025-03-04 00:11:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:27,494 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 427 transitions. [2025-03-04 00:11:27,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2025-03-04 00:11:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-04 00:11:27,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:27,497 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:11:27,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:27,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -447581793, now seen corresponding path program 1 times [2025-03-04 00:11:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017231] [2025-03-04 00:11:27,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:27,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-04 00:11:27,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-04 00:11:27,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:27,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565017231] [2025-03-04 00:11:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565017231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074898094] [2025-03-04 00:11:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:28,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:28,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:28,054 INFO L87 Difference]: Start difference. First operand 267 states and 427 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:28,200 INFO L93 Difference]: Finished difference Result 598 states and 944 transitions. [2025-03-04 00:11:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-03-04 00:11:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:28,203 INFO L225 Difference]: With dead ends: 598 [2025-03-04 00:11:28,205 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 00:11:28,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:28,206 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 215 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:28,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 716 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 00:11:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 379. [2025-03-04 00:11:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 283 states have (on average 1.4770318021201414) internal successors, (418), 284 states have internal predecessors, (418), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:11:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2025-03-04 00:11:28,246 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 288 [2025-03-04 00:11:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:28,246 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2025-03-04 00:11:28,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2025-03-04 00:11:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-04 00:11:28,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:28,250 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:28,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:11:28,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1770176160, now seen corresponding path program 1 times [2025-03-04 00:11:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510649445] [2025-03-04 00:11:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-04 00:11:28,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-04 00:11:28,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510649445] [2025-03-04 00:11:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510649445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:28,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135601949] [2025-03-04 00:11:28,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:28,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:28,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:28,374 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:28,451 INFO L93 Difference]: Finished difference Result 905 states and 1429 transitions. [2025-03-04 00:11:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-03-04 00:11:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:28,456 INFO L225 Difference]: With dead ends: 905 [2025-03-04 00:11:28,456 INFO L226 Difference]: Without dead ends: 616 [2025-03-04 00:11:28,457 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-04 00:11:28,457 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 239 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:28,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 667 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:11:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-04 00:11:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 460. [2025-03-04 00:11:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 364 states have (on average 1.5054945054945055) internal successors, (548), 365 states have internal predecessors, (548), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:11:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2025-03-04 00:11:28,496 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 288 [2025-03-04 00:11:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:28,499 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2025-03-04 00:11:28,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2025-03-04 00:11:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-04 00:11:28,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:28,501 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:28,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:11:28,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:28,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2099941921, now seen corresponding path program 1 times [2025-03-04 00:11:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:28,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473978213] [2025-03-04 00:11:28,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:28,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-04 00:11:28,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-04 00:11:28,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:28,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473978213] [2025-03-04 00:11:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473978213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:28,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:28,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000935751] [2025-03-04 00:11:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:28,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:28,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:28,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:28,833 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:28,908 INFO L93 Difference]: Finished difference Result 1023 states and 1635 transitions. [2025-03-04 00:11:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:28,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 288 [2025-03-04 00:11:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:28,912 INFO L225 Difference]: With dead ends: 1023 [2025-03-04 00:11:28,913 INFO L226 Difference]: Without dead ends: 656 [2025-03-04 00:11:28,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:28,914 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 164 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:28,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 612 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-04 00:11:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 634. [2025-03-04 00:11:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 494 states have (on average 1.5060728744939271) internal successors, (744), 495 states have internal predecessors, (744), 135 states have call successors, (135), 4 states have call predecessors, (135), 4 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 00:11:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1014 transitions. [2025-03-04 00:11:28,960 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1014 transitions. Word has length 288 [2025-03-04 00:11:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:28,960 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 1014 transitions. [2025-03-04 00:11:28,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1014 transitions. [2025-03-04 00:11:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-04 00:11:28,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:28,964 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:28,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:11:28,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:28,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1757927059, now seen corresponding path program 1 times [2025-03-04 00:11:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302339887] [2025-03-04 00:11:28,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:28,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-04 00:11:29,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-04 00:11:29,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:29,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302339887] [2025-03-04 00:11:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302339887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749179357] [2025-03-04 00:11:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:30,221 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-04 00:11:30,223 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-04 00:11:30,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-04 00:11:30,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-04 00:11:30,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:30,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:11:30,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1638 proven. 84 refuted. 0 times theorem prover too weak. 1890 trivial. 0 not checked. [2025-03-04 00:11:30,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 42 proven. 84 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:31,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749179357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:31,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:31,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-04 00:11:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367386357] [2025-03-04 00:11:31,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:31,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:11:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:31,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:11:31,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:11:31,132 INFO L87 Difference]: Start difference. First operand 634 states and 1014 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 5 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (115), 5 states have call predecessors, (115), 5 states have call successors, (115) [2025-03-04 00:11:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:32,422 INFO L93 Difference]: Finished difference Result 1653 states and 2607 transitions. [2025-03-04 00:11:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 00:11:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 5 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (115), 5 states have call predecessors, (115), 5 states have call successors, (115) Word has length 289 [2025-03-04 00:11:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:32,427 INFO L225 Difference]: With dead ends: 1653 [2025-03-04 00:11:32,427 INFO L226 Difference]: Without dead ends: 1103 [2025-03-04 00:11:32,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=852, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:11:32,429 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1930 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:32,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 1376 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:11:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-03-04 00:11:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 871. [2025-03-04 00:11:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 689 states have (on average 1.4586357039187228) internal successors, (1005), 691 states have internal predecessors, (1005), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 167 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-04 00:11:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1343 transitions. [2025-03-04 00:11:32,485 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1343 transitions. Word has length 289 [2025-03-04 00:11:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1343 transitions. [2025-03-04 00:11:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 5 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (115), 5 states have call predecessors, (115), 5 states have call successors, (115) [2025-03-04 00:11:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1343 transitions. [2025-03-04 00:11:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-04 00:11:32,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:32,489 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:32,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:32,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 00:11:32,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:32,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 23691403, now seen corresponding path program 1 times [2025-03-04 00:11:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774296349] [2025-03-04 00:11:32,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:32,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-04 00:11:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-04 00:11:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 78 proven. 48 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774296349] [2025-03-04 00:11:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774296349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808830214] [2025-03-04 00:11:33,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:33,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:33,295 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-04 00:11:33,297 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-04 00:11:33,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-04 00:11:33,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-04 00:11:33,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:33,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:33,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:11:33,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1248 proven. 99 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2025-03-04 00:11:33,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 27 proven. 99 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808830214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:34,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2025-03-04 00:11:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272536471] [2025-03-04 00:11:34,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:11:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:34,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:11:34,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:11:34,157 INFO L87 Difference]: Start difference. First operand 871 states and 1343 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (111), 3 states have call predecessors, (111), 3 states have call successors, (111) [2025-03-04 00:11:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:34,849 INFO L93 Difference]: Finished difference Result 1609 states and 2429 transitions. [2025-03-04 00:11:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:11:34,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (111), 3 states have call predecessors, (111), 3 states have call successors, (111) Word has length 290 [2025-03-04 00:11:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:34,856 INFO L225 Difference]: With dead ends: 1609 [2025-03-04 00:11:34,856 INFO L226 Difference]: Without dead ends: 838 [2025-03-04 00:11:34,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 574 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:11:34,859 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 921 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:34,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 823 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:11:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-04 00:11:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 807. [2025-03-04 00:11:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 611 states have (on average 1.364975450081833) internal successors, (834), 613 states have internal predecessors, (834), 171 states have call successors, (171), 24 states have call predecessors, (171), 24 states have return successors, (171), 169 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-04 00:11:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1176 transitions. [2025-03-04 00:11:34,938 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1176 transitions. Word has length 290 [2025-03-04 00:11:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:34,938 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1176 transitions. [2025-03-04 00:11:34,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (111), 3 states have call predecessors, (111), 3 states have call successors, (111) [2025-03-04 00:11:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1176 transitions. [2025-03-04 00:11:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-04 00:11:34,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:34,943 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:34,950 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-04 00:11:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:35,143 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1968775021, now seen corresponding path program 1 times [2025-03-04 00:11:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029496398] [2025-03-04 00:11:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:35,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 00:11:35,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 00:11:35,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:35,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:35,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029496398] [2025-03-04 00:11:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029496398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678464826] [2025-03-04 00:11:35,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:35,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:35,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:35,527 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-04 00:11:35,529 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-04 00:11:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 00:11:35,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 00:11:35,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:35,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:35,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:11:35,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-03-04 00:11:36,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678464826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:36,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:36,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:11:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50301928] [2025-03-04 00:11:36,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:36,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:11:36,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:36,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:11:36,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:11:36,412 INFO L87 Difference]: Start difference. First operand 807 states and 1176 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:11:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:36,667 INFO L93 Difference]: Finished difference Result 1531 states and 2218 transitions. [2025-03-04 00:11:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:11:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 291 [2025-03-04 00:11:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:36,673 INFO L225 Difference]: With dead ends: 1531 [2025-03-04 00:11:36,674 INFO L226 Difference]: Without dead ends: 847 [2025-03-04 00:11:36,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:11:36,677 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 125 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:36,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 519 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-04 00:11:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 825. [2025-03-04 00:11:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 624 states have (on average 1.3413461538461537) internal successors, (837), 626 states have internal predecessors, (837), 171 states have call successors, (171), 29 states have call predecessors, (171), 29 states have return successors, (171), 169 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-04 00:11:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1179 transitions. [2025-03-04 00:11:36,725 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1179 transitions. Word has length 291 [2025-03-04 00:11:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:36,725 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1179 transitions. [2025-03-04 00:11:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:11:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1179 transitions. [2025-03-04 00:11:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 00:11:36,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:36,729 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:36,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:36,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1897229083, now seen corresponding path program 1 times [2025-03-04 00:11:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182227817] [2025-03-04 00:11:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:36,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 00:11:37,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 00:11:37,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:37,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182227817] [2025-03-04 00:11:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182227817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:37,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:37,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:11:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036633170] [2025-03-04 00:11:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:37,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:11:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:37,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:11:37,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:37,341 INFO L87 Difference]: Start difference. First operand 825 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:37,623 INFO L93 Difference]: Finished difference Result 2216 states and 3162 transitions. [2025-03-04 00:11:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:11:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 292 [2025-03-04 00:11:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:37,632 INFO L225 Difference]: With dead ends: 2216 [2025-03-04 00:11:37,633 INFO L226 Difference]: Without dead ends: 1512 [2025-03-04 00:11:37,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:37,635 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 287 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:37,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1120 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-04 00:11:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1196. [2025-03-04 00:11:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 974 states have (on average 1.3788501026694044) internal successors, (1343), 979 states have internal predecessors, (1343), 189 states have call successors, (189), 32 states have call predecessors, (189), 32 states have return successors, (189), 184 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-04 00:11:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1721 transitions. [2025-03-04 00:11:37,704 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1721 transitions. Word has length 292 [2025-03-04 00:11:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:37,704 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1721 transitions. [2025-03-04 00:11:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1721 transitions. [2025-03-04 00:11:37,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 00:11:37,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:37,708 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:37,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:11:37,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1373044292, now seen corresponding path program 1 times [2025-03-04 00:11:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:37,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814214610] [2025-03-04 00:11:37,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:37,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 00:11:37,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 00:11:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:11:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814214610] [2025-03-04 00:11:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814214610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:38,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:38,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:11:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885184263] [2025-03-04 00:11:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:38,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:11:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:38,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:11:38,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:11:38,279 INFO L87 Difference]: Start difference. First operand 1196 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:39,026 INFO L93 Difference]: Finished difference Result 3123 states and 4480 transitions. [2025-03-04 00:11:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:11:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 292 [2025-03-04 00:11:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:39,037 INFO L225 Difference]: With dead ends: 3123 [2025-03-04 00:11:39,037 INFO L226 Difference]: Without dead ends: 2023 [2025-03-04 00:11:39,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:11:39,040 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 900 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:39,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1514 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:11:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-03-04 00:11:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1846. [2025-03-04 00:11:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1457 states have (on average 1.3548387096774193) internal successors, (1974), 1465 states have internal predecessors, (1974), 330 states have call successors, (330), 58 states have call predecessors, (330), 58 states have return successors, (330), 322 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-04 00:11:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2634 transitions. [2025-03-04 00:11:39,150 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2634 transitions. Word has length 292 [2025-03-04 00:11:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:39,150 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2634 transitions. [2025-03-04 00:11:39,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:11:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2634 transitions. [2025-03-04 00:11:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 00:11:39,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:39,153 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:39,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:11:39,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:39,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -260385607, now seen corresponding path program 1 times [2025-03-04 00:11:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:39,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012389599] [2025-03-04 00:11:39,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 00:11:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 00:11:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:40,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012389599] [2025-03-04 00:11:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012389599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779195220] [2025-03-04 00:11:40,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:40,071 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-04 00:11:40,074 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-04 00:11:40,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 00:11:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 00:11:40,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:40,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:40,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:11:40,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2201 proven. 138 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-03-04 00:11:40,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 222 proven. 147 refuted. 0 times theorem prover too weak. 3243 trivial. 0 not checked. [2025-03-04 00:11:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779195220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:41,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 23 [2025-03-04 00:11:41,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790285530] [2025-03-04 00:11:41,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:11:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:41,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:11:41,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:11:41,425 INFO L87 Difference]: Start difference. First operand 1846 states and 2634 transitions. Second operand has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-04 00:11:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:43,135 INFO L93 Difference]: Finished difference Result 2833 states and 4032 transitions. [2025-03-04 00:11:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 00:11:43,136 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) Word has length 292 [2025-03-04 00:11:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:43,143 INFO L225 Difference]: With dead ends: 2833 [2025-03-04 00:11:43,143 INFO L226 Difference]: Without dead ends: 1761 [2025-03-04 00:11:43,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 576 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=958, Invalid=2702, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 00:11:43,148 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1467 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:43,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1460 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:11:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-04 00:11:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 459. [2025-03-04 00:11:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 345 states have (on average 1.3072463768115943) internal successors, (451), 346 states have internal predecessors, (451), 94 states have call successors, (94), 19 states have call predecessors, (94), 19 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 00:11:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 639 transitions. [2025-03-04 00:11:43,205 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 639 transitions. Word has length 292 [2025-03-04 00:11:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 639 transitions. [2025-03-04 00:11:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 6 states have call successors, (119), 4 states have call predecessors, (119), 10 states have return successors, (120), 6 states have call predecessors, (120), 6 states have call successors, (120) [2025-03-04 00:11:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 639 transitions. [2025-03-04 00:11:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 00:11:43,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:43,209 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:43,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:11:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 00:11:43,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash 929601955, now seen corresponding path program 1 times [2025-03-04 00:11:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997605379] [2025-03-04 00:11:43,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:11:43,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:11:43,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:43,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:43,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997605379] [2025-03-04 00:11:43,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997605379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:43,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876241442] [2025-03-04 00:11:43,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:43,861 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:11:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:11:44,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:11:44,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:44,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:44,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:11:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-03-04 00:11:44,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:11:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876241442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:45,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-03-04 00:11:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514700638] [2025-03-04 00:11:45,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:45,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:11:45,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:45,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:11:45,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:11:45,123 INFO L87 Difference]: Start difference. First operand 459 states and 639 transitions. Second operand has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) [2025-03-04 00:11:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:46,284 INFO L93 Difference]: Finished difference Result 895 states and 1240 transitions. [2025-03-04 00:11:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:11:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) Word has length 293 [2025-03-04 00:11:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:46,288 INFO L225 Difference]: With dead ends: 895 [2025-03-04 00:11:46,288 INFO L226 Difference]: Without dead ends: 558 [2025-03-04 00:11:46,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:11:46,291 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1259 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:46,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1498 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:11:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-04 00:11:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 439. [2025-03-04 00:11:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 325 states have (on average 1.2923076923076924) internal successors, (420), 326 states have internal predecessors, (420), 94 states have call successors, (94), 19 states have call predecessors, (94), 19 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 00:11:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 608 transitions. [2025-03-04 00:11:46,330 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 608 transitions. Word has length 293 [2025-03-04 00:11:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:46,331 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 608 transitions. [2025-03-04 00:11:46,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.0) internal successors, (221), 17 states have internal predecessors, (221), 5 states have call successors, (122), 3 states have call predecessors, (122), 6 states have return successors, (123), 5 states have call predecessors, (123), 5 states have call successors, (123) [2025-03-04 00:11:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 608 transitions. [2025-03-04 00:11:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 00:11:46,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:46,333 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:46,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:11:46,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:46,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:46,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 278066561, now seen corresponding path program 1 times [2025-03-04 00:11:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306018570] [2025-03-04 00:11:46,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:46,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:11:46,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:11:46,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:46,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 87 proven. 159 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2025-03-04 00:12:02,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306018570] [2025-03-04 00:12:02,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306018570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:02,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736046986] [2025-03-04 00:12:02,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:02,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:02,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:12:02,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:12:02,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:12:02,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:02,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:02,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:12:02,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1774 proven. 159 refuted. 0 times theorem prover too weak. 1679 trivial. 0 not checked. [2025-03-04 00:12:04,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736046986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:17,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:12:17,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-03-04 00:12:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873410244] [2025-03-04 00:12:17,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:17,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:12:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:17,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:12:17,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:12:17,169 INFO L87 Difference]: Start difference. First operand 439 states and 608 transitions. Second operand has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (86), 4 states have call predecessors, (86), 7 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2025-03-04 00:12:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:20,108 INFO L93 Difference]: Finished difference Result 1186 states and 1650 transitions. [2025-03-04 00:12:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 00:12:20,108 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (86), 4 states have call predecessors, (86), 7 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) Word has length 293 [2025-03-04 00:12:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:20,112 INFO L225 Difference]: With dead ends: 1186 [2025-03-04 00:12:20,112 INFO L226 Difference]: Without dead ends: 869 [2025-03-04 00:12:20,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=427, Invalid=2023, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 00:12:20,113 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 634 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:20,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 2999 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:12:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-04 00:12:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 676. [2025-03-04 00:12:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 531 states have (on average 1.3163841807909604) internal successors, (699), 534 states have internal predecessors, (699), 116 states have call successors, (116), 28 states have call predecessors, (116), 28 states have return successors, (116), 113 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 00:12:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 931 transitions. [2025-03-04 00:12:20,170 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 931 transitions. Word has length 293 [2025-03-04 00:12:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:20,171 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 931 transitions. [2025-03-04 00:12:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.521739130434782) internal successors, (150), 23 states have internal predecessors, (150), 7 states have call successors, (86), 4 states have call predecessors, (86), 7 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2025-03-04 00:12:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 931 transitions. [2025-03-04 00:12:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 00:12:20,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:20,173 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:20,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:12:20,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:20,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash -746627360, now seen corresponding path program 1 times [2025-03-04 00:12:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516787492] [2025-03-04 00:12:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:12:20,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:12:20,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:20,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 42 proven. 84 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:12:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516787492] [2025-03-04 00:12:20,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516787492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648089033] [2025-03-04 00:12:20,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:20,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:20,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:20,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:12:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:12:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:12:20,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:20,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:20,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:12:20,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1758 proven. 48 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2025-03-04 00:12:21,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 78 proven. 48 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:12:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648089033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:21,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 21 [2025-03-04 00:12:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286704340] [2025-03-04 00:12:21,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:21,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:12:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:21,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:12:21,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:12:21,647 INFO L87 Difference]: Start difference. First operand 676 states and 931 transitions. Second operand has 21 states, 21 states have (on average 9.0) internal successors, (189), 21 states have internal predecessors, (189), 5 states have call successors, (129), 3 states have call predecessors, (129), 6 states have return successors, (129), 5 states have call predecessors, (129), 5 states have call successors, (129) [2025-03-04 00:12:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:23,011 INFO L93 Difference]: Finished difference Result 1560 states and 2181 transitions. [2025-03-04 00:12:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:12:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.0) internal successors, (189), 21 states have internal predecessors, (189), 5 states have call successors, (129), 3 states have call predecessors, (129), 6 states have return successors, (129), 5 states have call predecessors, (129), 5 states have call successors, (129) Word has length 293 [2025-03-04 00:12:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:23,016 INFO L225 Difference]: With dead ends: 1560 [2025-03-04 00:12:23,016 INFO L226 Difference]: Without dead ends: 1243 [2025-03-04 00:12:23,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:12:23,017 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 845 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:23,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2893 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:12:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-04 00:12:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 973. [2025-03-04 00:12:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 766 states have (on average 1.3224543080939948) internal successors, (1013), 770 states have internal predecessors, (1013), 167 states have call successors, (167), 39 states have call predecessors, (167), 39 states have return successors, (167), 163 states have call predecessors, (167), 167 states have call successors, (167) [2025-03-04 00:12:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1347 transitions. [2025-03-04 00:12:23,100 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1347 transitions. Word has length 293 [2025-03-04 00:12:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:23,100 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1347 transitions. [2025-03-04 00:12:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.0) internal successors, (189), 21 states have internal predecessors, (189), 5 states have call successors, (129), 3 states have call predecessors, (129), 6 states have return successors, (129), 5 states have call predecessors, (129), 5 states have call successors, (129) [2025-03-04 00:12:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1347 transitions. [2025-03-04 00:12:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-04 00:12:23,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:23,102 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:23,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:12:23,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1279331166, now seen corresponding path program 1 times [2025-03-04 00:12:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:23,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801338028] [2025-03-04 00:12:23,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-04 00:12:23,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 00:12:23,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat