./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.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_amount500_file-27.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 5acf4253b443244094cfe64cde0a882806db433781b0bda7a83218841032b1a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:31:09,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:31:09,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:31:09,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:31:09,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:31:09,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:31:09,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:31:09,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:31:09,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:31:09,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:31:09,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:31:09,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:31:09,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:31:09,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:31:09,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:31:09,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:09,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:31:09,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:31:09,476 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 -> 5acf4253b443244094cfe64cde0a882806db433781b0bda7a83218841032b1a3 [2025-03-04 00:31:09,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:31:09,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:31:09,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:31:09,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:31:09,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:31:09,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i [2025-03-04 00:31:10,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a4935e7/592ac67bb7eb406ea04f9aa998fd1035/FLAG8b77b6011 [2025-03-04 00:31:11,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:31:11,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i [2025-03-04 00:31:11,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a4935e7/592ac67bb7eb406ea04f9aa998fd1035/FLAG8b77b6011 [2025-03-04 00:31:11,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a4935e7/592ac67bb7eb406ea04f9aa998fd1035 [2025-03-04 00:31:11,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:31:11,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:31:11,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:11,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:31:11,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:31:11,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11, skipping insertion in model container [2025-03-04 00:31:11,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:31:11,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i[916,929] [2025-03-04 00:31:11,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:11,707 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:31:11,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i[916,929] [2025-03-04 00:31:11,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:11,799 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:31:11,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11 WrapperNode [2025-03-04 00:31:11,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:11,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:11,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:31:11,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:31:11,807 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:31:11" (1/1) ... [2025-03-04 00:31:11,820 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:31:11" (1/1) ... [2025-03-04 00:31:11,875 INFO L138 Inliner]: procedures = 26, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 737 [2025-03-04 00:31:11,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:11,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:31:11,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:31:11,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:31:11,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,964 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:31:11,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:11,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:12,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:12,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:12,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:31:12,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:31:12,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:31:12,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:31:12,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (1/1) ... [2025-03-04 00:31:12,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:12,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:12,054 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:31:12,059 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:31:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:31:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:31:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:31:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:31:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:31:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:31:12,189 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:31:12,191 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:31:13,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~bitwise65#1;havoc property_#t~short66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~short69#1; [2025-03-04 00:31:13,198 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-04 00:31:13,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:31:13,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:31:13,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:31:13,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:13 BoogieIcfgContainer [2025-03-04 00:31:13,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:31:13,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:31:13,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:31:13,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:31:13,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:31:11" (1/3) ... [2025-03-04 00:31:13,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac12ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:13, skipping insertion in model container [2025-03-04 00:31:13,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:11" (2/3) ... [2025-03-04 00:31:13,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac12ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:13, skipping insertion in model container [2025-03-04 00:31:13,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:13" (3/3) ... [2025-03-04 00:31:13,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-27.i [2025-03-04 00:31:13,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:31:13,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-27.i that has 2 procedures, 294 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:31:13,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:31:13,310 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;@f4876e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:31:13,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:31:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 201 states have (on average 1.507462686567164) internal successors, (303), 202 states have internal predecessors, (303), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:31:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-04 00:31:13,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:13,337 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:13,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 911699290, now seen corresponding path program 1 times [2025-03-04 00:31:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100382254] [2025-03-04 00:31:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:13,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-04 00:31:13,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-04 00:31:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-03-04 00:31:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100382254] [2025-03-04 00:31:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100382254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098186243] [2025-03-04 00:31:13,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:13,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:13,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:13,980 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:31:13,982 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:31:14,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-04 00:31:14,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-04 00:31:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:14,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:31:14,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-03-04 00:31:14,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098186243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:31:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629931001] [2025-03-04 00:31:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:14,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:31:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:14,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:31:14,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:31:14,493 INFO L87 Difference]: Start difference. First operand has 294 states, 201 states have (on average 1.507462686567164) internal successors, (303), 202 states have internal predecessors, (303), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-03-04 00:31:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:14,562 INFO L93 Difference]: Finished difference Result 582 states and 1051 transitions. [2025-03-04 00:31:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:31:14,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) Word has length 589 [2025-03-04 00:31:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:14,577 INFO L225 Difference]: With dead ends: 582 [2025-03-04 00:31:14,577 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 00:31:14,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 590 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:31:14,587 INFO L435 NwaCegarLoop]: 470 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, 470 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:31:14,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 00:31:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-04 00:31:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 199 states have (on average 1.4974874371859297) internal successors, (298), 199 states have internal predecessors, (298), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 00:31:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 478 transitions. [2025-03-04 00:31:14,664 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 478 transitions. Word has length 589 [2025-03-04 00:31:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:14,665 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 478 transitions. [2025-03-04 00:31:14,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-03-04 00:31:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 478 transitions. [2025-03-04 00:31:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-04 00:31:14,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:14,681 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:14,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:31:14,885 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:31:14,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1376288522, now seen corresponding path program 1 times [2025-03-04 00:31:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924950307] [2025-03-04 00:31:14,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:14,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-04 00:31:15,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-04 00:31:15,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:15,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924950307] [2025-03-04 00:31:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924950307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366610224] [2025-03-04 00:31:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:15,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:15,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:15,526 INFO L87 Difference]: Start difference. First operand 291 states and 478 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:15,692 INFO L93 Difference]: Finished difference Result 732 states and 1205 transitions. [2025-03-04 00:31:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:15,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 589 [2025-03-04 00:31:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:15,700 INFO L225 Difference]: With dead ends: 732 [2025-03-04 00:31:15,700 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 00:31:15,702 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:31:15,703 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 236 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:15,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 977 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 00:31:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2025-03-04 00:31:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 320 states have (on average 1.525) internal successors, (488), 321 states have internal predecessors, (488), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:31:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 724 transitions. [2025-03-04 00:31:15,749 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 724 transitions. Word has length 589 [2025-03-04 00:31:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:15,750 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 724 transitions. [2025-03-04 00:31:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 724 transitions. [2025-03-04 00:31:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:15,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:15,757 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:15,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:31:15,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:15,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2147478780, now seen corresponding path program 1 times [2025-03-04 00:31:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:15,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33488956] [2025-03-04 00:31:15,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:15,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:15,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:15,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:16,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33488956] [2025-03-04 00:31:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33488956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:16,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690504297] [2025-03-04 00:31:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:16,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:16,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:16,301 INFO L87 Difference]: Start difference. First operand 441 states and 724 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:16,413 INFO L93 Difference]: Finished difference Result 1303 states and 2142 transitions. [2025-03-04 00:31:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-03-04 00:31:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:16,427 INFO L225 Difference]: With dead ends: 1303 [2025-03-04 00:31:16,427 INFO L226 Difference]: Without dead ends: 865 [2025-03-04 00:31:16,430 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:31:16,432 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 431 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:16,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 921 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-04 00:31:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 553. [2025-03-04 00:31:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 432 states have (on average 1.5902777777777777) internal successors, (687), 433 states have internal predecessors, (687), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:31:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 923 transitions. [2025-03-04 00:31:16,509 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 923 transitions. Word has length 590 [2025-03-04 00:31:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 923 transitions. [2025-03-04 00:31:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 923 transitions. [2025-03-04 00:31:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:16,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:16,514 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:31:16,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1936137603, now seen corresponding path program 1 times [2025-03-04 00:31:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457861916] [2025-03-04 00:31:16,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:16,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:17,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457861916] [2025-03-04 00:31:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457861916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:18,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:18,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:18,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128120970] [2025-03-04 00:31:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:18,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:18,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:18,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:18,194 INFO L87 Difference]: Start difference. First operand 553 states and 923 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:18,503 INFO L93 Difference]: Finished difference Result 2063 states and 3450 transitions. [2025-03-04 00:31:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-03-04 00:31:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:18,511 INFO L225 Difference]: With dead ends: 2063 [2025-03-04 00:31:18,511 INFO L226 Difference]: Without dead ends: 1513 [2025-03-04 00:31:18,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:31:18,514 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 694 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:18,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1468 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-03-04 00:31:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1209. [2025-03-04 00:31:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 997 states have (on average 1.6158475426278835) internal successors, (1611), 1000 states have internal predecessors, (1611), 207 states have call successors, (207), 4 states have call predecessors, (207), 4 states have return successors, (207), 204 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-04 00:31:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 2025 transitions. [2025-03-04 00:31:18,600 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 2025 transitions. Word has length 590 [2025-03-04 00:31:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:18,601 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 2025 transitions. [2025-03-04 00:31:18,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 2025 transitions. [2025-03-04 00:31:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:18,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:18,606 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:31:18,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:18,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1787578460, now seen corresponding path program 1 times [2025-03-04 00:31:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376586426] [2025-03-04 00:31:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:18,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:18,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:18,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:18,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376586426] [2025-03-04 00:31:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376586426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394236479] [2025-03-04 00:31:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:18,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:18,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:18,870 INFO L87 Difference]: Start difference. First operand 1209 states and 2025 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:18,976 INFO L93 Difference]: Finished difference Result 2464 states and 4123 transitions. [2025-03-04 00:31:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:18,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-03-04 00:31:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:18,986 INFO L225 Difference]: With dead ends: 2464 [2025-03-04 00:31:18,986 INFO L226 Difference]: Without dead ends: 1258 [2025-03-04 00:31:18,989 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:31:18,990 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 367 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:18,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1166 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-04 00:31:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 799. [2025-03-04 00:31:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 677 states have (on average 1.6144756277695715) internal successors, (1093), 678 states have internal predecessors, (1093), 118 states have call successors, (118), 3 states have call predecessors, (118), 3 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:31:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1329 transitions. [2025-03-04 00:31:19,050 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1329 transitions. Word has length 590 [2025-03-04 00:31:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:19,052 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1329 transitions. [2025-03-04 00:31:19,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1329 transitions. [2025-03-04 00:31:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:19,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:19,057 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:31:19,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:19,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2069379333, now seen corresponding path program 1 times [2025-03-04 00:31:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487949244] [2025-03-04 00:31:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:19,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:19,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487949244] [2025-03-04 00:31:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487949244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274395724] [2025-03-04 00:31:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:20,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:20,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:20,107 INFO L87 Difference]: Start difference. First operand 799 states and 1329 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:20,541 INFO L93 Difference]: Finished difference Result 3301 states and 5503 transitions. [2025-03-04 00:31:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-03-04 00:31:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:20,555 INFO L225 Difference]: With dead ends: 3301 [2025-03-04 00:31:20,555 INFO L226 Difference]: Without dead ends: 2505 [2025-03-04 00:31:20,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:20,560 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 1252 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:20,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 2517 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-04 00:31:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 803. [2025-03-04 00:31:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 681 states have (on average 1.6123348017621146) internal successors, (1098), 682 states have internal predecessors, (1098), 118 states have call successors, (118), 3 states have call predecessors, (118), 3 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-04 00:31:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1334 transitions. [2025-03-04 00:31:20,619 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1334 transitions. Word has length 590 [2025-03-04 00:31:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:20,619 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1334 transitions. [2025-03-04 00:31:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1334 transitions. [2025-03-04 00:31:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:20,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:20,624 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:31:20,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2049041958, now seen corresponding path program 1 times [2025-03-04 00:31:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69694882] [2025-03-04 00:31:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:20,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:21,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:21,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 81 proven. 186 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69694882] [2025-03-04 00:31:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69694882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254564094] [2025-03-04 00:31:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:22,432 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:31:22,433 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:31:22,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:22,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:22,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:22,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:22,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:31:22,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 9831 proven. 360 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2025-03-04 00:31:24,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 132 proven. 135 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:26,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254564094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:26,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 7] total 16 [2025-03-04 00:31:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546961122] [2025-03-04 00:31:26,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:26,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:31:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:26,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:31:26,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:31:26,234 INFO L87 Difference]: Start difference. First operand 803 states and 1334 transitions. Second operand has 16 states, 16 states have (on average 24.125) internal successors, (386), 16 states have internal predecessors, (386), 7 states have call successors, (240), 4 states have call predecessors, (240), 7 states have return successors, (241), 7 states have call predecessors, (241), 7 states have call successors, (241) [2025-03-04 00:31:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:27,634 INFO L93 Difference]: Finished difference Result 1778 states and 2898 transitions. [2025-03-04 00:31:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:31:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 24.125) internal successors, (386), 16 states have internal predecessors, (386), 7 states have call successors, (240), 4 states have call predecessors, (240), 7 states have return successors, (241), 7 states have call predecessors, (241), 7 states have call successors, (241) Word has length 590 [2025-03-04 00:31:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:27,640 INFO L225 Difference]: With dead ends: 1778 [2025-03-04 00:31:27,640 INFO L226 Difference]: Without dead ends: 978 [2025-03-04 00:31:27,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1173 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=462, Invalid=1098, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 00:31:27,643 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 607 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:27,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1158 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:31:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-04 00:31:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 896. [2025-03-04 00:31:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 755 states have (on average 1.5735099337748344) internal successors, (1188), 757 states have internal predecessors, (1188), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 00:31:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1444 transitions. [2025-03-04 00:31:27,694 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1444 transitions. Word has length 590 [2025-03-04 00:31:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1444 transitions. [2025-03-04 00:31:27,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.125) internal successors, (386), 16 states have internal predecessors, (386), 7 states have call successors, (240), 4 states have call predecessors, (240), 7 states have return successors, (241), 7 states have call predecessors, (241), 7 states have call successors, (241) [2025-03-04 00:31:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1444 transitions. [2025-03-04 00:31:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-04 00:31:27,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:27,701 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:27,711 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:31:27,902 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:31:27,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1226236741, now seen corresponding path program 1 times [2025-03-04 00:31:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002709084] [2025-03-04 00:31:27,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:27,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:28,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:28,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 87 proven. 180 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:28,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002709084] [2025-03-04 00:31:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002709084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394245117] [2025-03-04 00:31:28,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:28,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:28,977 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:31:28,979 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:31:29,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-04 00:31:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-04 00:31:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:29,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:31:29,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 7107 proven. 180 refuted. 0 times theorem prover too weak. 8733 trivial. 0 not checked. [2025-03-04 00:31:29,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 87 proven. 180 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394245117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:30,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:31:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306705245] [2025-03-04 00:31:30,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:31:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:30,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:31:30,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:30,178 INFO L87 Difference]: Start difference. First operand 896 states and 1444 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) [2025-03-04 00:31:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:30,580 INFO L93 Difference]: Finished difference Result 1484 states and 2382 transitions. [2025-03-04 00:31:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:31:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) Word has length 590 [2025-03-04 00:31:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:30,585 INFO L225 Difference]: With dead ends: 1484 [2025-03-04 00:31:30,585 INFO L226 Difference]: Without dead ends: 591 [2025-03-04 00:31:30,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1187 GetRequests, 1177 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:30,587 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 476 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:30,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 875 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-04 00:31:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 581. [2025-03-04 00:31:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 469 states have (on average 1.5181236673773988) internal successors, (712), 470 states have internal predecessors, (712), 102 states have call successors, (102), 9 states have call predecessors, (102), 9 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 00:31:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 916 transitions. [2025-03-04 00:31:30,609 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 916 transitions. Word has length 590 [2025-03-04 00:31:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:30,611 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 916 transitions. [2025-03-04 00:31:30,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) [2025-03-04 00:31:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 916 transitions. [2025-03-04 00:31:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-04 00:31:30,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:30,614 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:30,623 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:31:30,815 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:31:30,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:30,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 853246680, now seen corresponding path program 1 times [2025-03-04 00:31:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631316238] [2025-03-04 00:31:30,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:30,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-04 00:31:31,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-04 00:31:31,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:31,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 75 proven. 192 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631316238] [2025-03-04 00:31:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631316238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870339906] [2025-03-04 00:31:32,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:32,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:32,281 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:31:32,282 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:31:32,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-04 00:31:32,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-04 00:31:32,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:32,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:32,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:31:32,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 7043 proven. 84 refuted. 0 times theorem prover too weak. 8893 trivial. 0 not checked. [2025-03-04 00:31:32,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 183 proven. 84 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870339906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:33,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-04 00:31:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888941044] [2025-03-04 00:31:33,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:31:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:33,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:31:33,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:33,089 INFO L87 Difference]: Start difference. First operand 581 states and 916 transitions. Second operand has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-03-04 00:31:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:34,222 INFO L93 Difference]: Finished difference Result 1345 states and 2113 transitions. [2025-03-04 00:31:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:31:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) Word has length 591 [2025-03-04 00:31:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:34,228 INFO L225 Difference]: With dead ends: 1345 [2025-03-04 00:31:34,228 INFO L226 Difference]: Without dead ends: 767 [2025-03-04 00:31:34,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1181 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:31:34,230 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1607 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:34,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1327 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:31:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-04 00:31:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 754. [2025-03-04 00:31:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 612 states have (on average 1.522875816993464) internal successors, (932), 614 states have internal predecessors, (932), 126 states have call successors, (126), 15 states have call predecessors, (126), 15 states have return successors, (126), 124 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-04 00:31:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1184 transitions. [2025-03-04 00:31:34,314 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1184 transitions. Word has length 591 [2025-03-04 00:31:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1184 transitions. [2025-03-04 00:31:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.454545454545453) internal successors, (258), 11 states have internal predecessors, (258), 3 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (184), 3 states have call predecessors, (184), 3 states have call successors, (184) [2025-03-04 00:31:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1184 transitions. [2025-03-04 00:31:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-04 00:31:34,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:34,345 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:31:34,548 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:31:34,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:34,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1493831609, now seen corresponding path program 1 times [2025-03-04 00:31:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580745942] [2025-03-04 00:31:34,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:34,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-04 00:31:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-04 00:31:34,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-04 00:31:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580745942] [2025-03-04 00:31:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580745942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940920507] [2025-03-04 00:31:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:35,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:35,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:35,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:35,425 INFO L87 Difference]: Start difference. First operand 754 states and 1184 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:35,726 INFO L93 Difference]: Finished difference Result 1505 states and 2365 transitions. [2025-03-04 00:31:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 591 [2025-03-04 00:31:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:35,730 INFO L225 Difference]: With dead ends: 1505 [2025-03-04 00:31:35,730 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 00:31:35,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:31:35,732 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 734 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:35,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 511 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 00:31:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 609. [2025-03-04 00:31:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 467 states have (on average 1.468950749464668) internal successors, (686), 469 states have internal predecessors, (686), 126 states have call successors, (126), 15 states have call predecessors, (126), 15 states have return successors, (126), 124 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-04 00:31:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 938 transitions. [2025-03-04 00:31:35,766 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 938 transitions. Word has length 591 [2025-03-04 00:31:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:35,767 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 938 transitions. [2025-03-04 00:31:35,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-04 00:31:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 938 transitions. [2025-03-04 00:31:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-04 00:31:35,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:35,773 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:31:35,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:35,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1033823773, now seen corresponding path program 1 times [2025-03-04 00:31:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271988406] [2025-03-04 00:31:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:35,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:35,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-04 00:31:37,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-04 00:31:37,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:37,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 96 proven. 171 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271988406] [2025-03-04 00:31:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271988406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169623929] [2025-03-04 00:31:38,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:38,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:38,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:38,012 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:31:38,014 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:31:38,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-04 00:31:38,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-04 00:31:38,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:38,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:38,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:31:38,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 7449 proven. 171 refuted. 0 times theorem prover too weak. 8400 trivial. 0 not checked. [2025-03-04 00:31:39,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 96 proven. 171 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169623929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:39,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-04 00:31:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138623745] [2025-03-04 00:31:39,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:39,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:31:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:39,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:31:39,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:31:39,943 INFO L87 Difference]: Start difference. First operand 609 states and 938 transitions. Second operand has 17 states, 17 states have (on average 16.41176470588235) internal successors, (279), 17 states have internal predecessors, (279), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-03-04 00:31:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:40,979 INFO L93 Difference]: Finished difference Result 1921 states and 2930 transitions. [2025-03-04 00:31:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:31:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.41176470588235) internal successors, (279), 17 states have internal predecessors, (279), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) Word has length 592 [2025-03-04 00:31:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:40,986 INFO L225 Difference]: With dead ends: 1921 [2025-03-04 00:31:40,986 INFO L226 Difference]: Without dead ends: 1315 [2025-03-04 00:31:40,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 1174 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:31:40,988 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1559 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:40,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 2496 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:31:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-03-04 00:31:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1213. [2025-03-04 00:31:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 928 states have (on average 1.4385775862068966) internal successors, (1335), 932 states have internal predecessors, (1335), 252 states have call successors, (252), 32 states have call predecessors, (252), 32 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-04 00:31:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1839 transitions. [2025-03-04 00:31:41,052 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1839 transitions. Word has length 592 [2025-03-04 00:31:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1839 transitions. [2025-03-04 00:31:41,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.41176470588235) internal successors, (279), 17 states have internal predecessors, (279), 5 states have call successors, (237), 3 states have call predecessors, (237), 6 states have return successors, (238), 5 states have call predecessors, (238), 5 states have call successors, (238) [2025-03-04 00:31:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1839 transitions. [2025-03-04 00:31:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-04 00:31:41,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:41,056 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:41,065 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:31:41,256 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,SelfDestructingSolverStorable10 [2025-03-04 00:31:41,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 15448159, now seen corresponding path program 1 times [2025-03-04 00:31:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781736198] [2025-03-04 00:31:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:41,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:31:41,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:31:41,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:41,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 114 proven. 153 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781736198] [2025-03-04 00:31:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781736198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485455423] [2025-03-04 00:31:42,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:42,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:42,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:42,214 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:31:42,215 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:31:42,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:31:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:31:42,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:42,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:42,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:31:42,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 8009 proven. 147 refuted. 0 times theorem prover too weak. 7864 trivial. 0 not checked. [2025-03-04 00:31:43,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 120 proven. 147 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:43,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485455423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:43,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2025-03-04 00:31:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129899222] [2025-03-04 00:31:43,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:43,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:31:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:43,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:31:43,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:31:43,760 INFO L87 Difference]: Start difference. First operand 1213 states and 1839 transitions. Second operand has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 6 states have call successors, (270), 3 states have call predecessors, (270), 6 states have return successors, (270), 6 states have call predecessors, (270), 6 states have call successors, (270) [2025-03-04 00:31:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:45,888 INFO L93 Difference]: Finished difference Result 3902 states and 5872 transitions. [2025-03-04 00:31:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 00:31:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 6 states have call successors, (270), 3 states have call predecessors, (270), 6 states have return successors, (270), 6 states have call predecessors, (270), 6 states have call successors, (270) Word has length 593 [2025-03-04 00:31:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:45,901 INFO L225 Difference]: With dead ends: 3902 [2025-03-04 00:31:45,901 INFO L226 Difference]: Without dead ends: 2692 [2025-03-04 00:31:45,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=447, Invalid=1445, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 00:31:45,904 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1611 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 978 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:45,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 2763 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [978 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:31:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-03-04 00:31:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 1956. [2025-03-04 00:31:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1441 states have (on average 1.3962526023594726) internal successors, (2012), 1447 states have internal predecessors, (2012), 442 states have call successors, (442), 72 states have call predecessors, (442), 72 states have return successors, (442), 436 states have call predecessors, (442), 442 states have call successors, (442) [2025-03-04 00:31:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2896 transitions. [2025-03-04 00:31:46,081 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2896 transitions. Word has length 593 [2025-03-04 00:31:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:46,081 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2896 transitions. [2025-03-04 00:31:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 6 states have call successors, (270), 3 states have call predecessors, (270), 6 states have return successors, (270), 6 states have call predecessors, (270), 6 states have call successors, (270) [2025-03-04 00:31:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2896 transitions. [2025-03-04 00:31:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-04 00:31:46,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:46,090 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:46,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:46,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:46,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash -902272897, now seen corresponding path program 1 times [2025-03-04 00:31:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117769179] [2025-03-04 00:31:46,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:46,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:46,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:31:46,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:31:46,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:46,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 48 proven. 219 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-03-04 00:31:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117769179] [2025-03-04 00:31:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117769179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459095699] [2025-03-04 00:31:47,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:47,946 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:31:47,947 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:31:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:31:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:31:48,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:48,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:31:48,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 9692 proven. 357 refuted. 0 times theorem prover too weak. 5971 trivial. 0 not checked. [2025-03-04 00:31:50,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 426 proven. 366 refuted. 0 times theorem prover too weak. 15228 trivial. 0 not checked. [2025-03-04 00:31:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459095699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:52,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 35 [2025-03-04 00:31:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407459869] [2025-03-04 00:31:52,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 00:31:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 00:31:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:31:52,706 INFO L87 Difference]: Start difference. First operand 1956 states and 2896 transitions. Second operand has 35 states, 33 states have (on average 11.333333333333334) internal successors, (374), 33 states have internal predecessors, (374), 10 states have call successors, (270), 5 states have call predecessors, (270), 11 states have return successors, (270), 9 states have call predecessors, (270), 10 states have call successors, (270) [2025-03-04 00:31:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:57,576 INFO L93 Difference]: Finished difference Result 5873 states and 8647 transitions. [2025-03-04 00:31:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 00:31:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 11.333333333333334) internal successors, (374), 33 states have internal predecessors, (374), 10 states have call successors, (270), 5 states have call predecessors, (270), 11 states have return successors, (270), 9 states have call predecessors, (270), 10 states have call successors, (270) Word has length 593 [2025-03-04 00:31:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:57,593 INFO L225 Difference]: With dead ends: 5873 [2025-03-04 00:31:57,594 INFO L226 Difference]: Without dead ends: 4132 [2025-03-04 00:31:57,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1172 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=952, Invalid=3338, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 00:31:57,598 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 2011 mSDsluCounter, 4617 mSDsCounter, 0 mSdLazyCounter, 5805 mSolverCounterSat, 1068 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 6873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1068 IncrementalHoareTripleChecker+Valid, 5805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:57,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 5114 Invalid, 6873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1068 Valid, 5805 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-04 00:31:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4132 states. [2025-03-04 00:31:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4132 to 3034. [2025-03-04 00:31:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 2159 states have (on average 1.3529411764705883) internal successors, (2921), 2173 states have internal predecessors, (2921), 742 states have call successors, (742), 132 states have call predecessors, (742), 132 states have return successors, (742), 728 states have call predecessors, (742), 742 states have call successors, (742) [2025-03-04 00:31:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4405 transitions. [2025-03-04 00:31:57,989 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4405 transitions. Word has length 593 [2025-03-04 00:31:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:57,990 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4405 transitions. [2025-03-04 00:31:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 11.333333333333334) internal successors, (374), 33 states have internal predecessors, (374), 10 states have call successors, (270), 5 states have call predecessors, (270), 11 states have return successors, (270), 9 states have call predecessors, (270), 10 states have call successors, (270) [2025-03-04 00:31:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4405 transitions. [2025-03-04 00:31:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-04 00:31:57,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:57,994 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:58,004 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:31:58,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:58,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1907638848, now seen corresponding path program 1 times [2025-03-04 00:31:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226014143] [2025-03-04 00:31:58,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:58,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:31:59,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:31:59,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 342 proven. 933 refuted. 0 times theorem prover too weak. 14745 trivial. 0 not checked. [2025-03-04 00:32:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226014143] [2025-03-04 00:32:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226014143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940040587] [2025-03-04 00:32:01,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:01,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:01,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:01,525 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:32:01,526 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:32:01,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-04 00:32:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-04 00:32:01,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:01,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:01,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 00:32:01,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 9490 proven. 990 refuted. 0 times theorem prover too weak. 5540 trivial. 0 not checked. [2025-03-04 00:32:04,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:32:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 522 proven. 1035 refuted. 0 times theorem prover too weak. 14463 trivial. 0 not checked. [2025-03-04 00:32:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940040587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:32:07,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:32:07,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29, 29] total 68 [2025-03-04 00:32:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036182387] [2025-03-04 00:32:07,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:32:07,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 00:32:07,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:07,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 00:32:07,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=3815, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 00:32:07,695 INFO L87 Difference]: Start difference. First operand 3034 states and 4405 transitions. Second operand has 68 states, 66 states have (on average 6.242424242424242) internal successors, (412), 65 states have internal predecessors, (412), 18 states have call successors, (248), 7 states have call predecessors, (248), 17 states have return successors, (249), 18 states have call predecessors, (249), 18 states have call successors, (249) [2025-03-04 00:32:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:18,674 INFO L93 Difference]: Finished difference Result 12341 states and 17669 transitions. [2025-03-04 00:32:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-04 00:32:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 6.242424242424242) internal successors, (412), 65 states have internal predecessors, (412), 18 states have call successors, (248), 7 states have call predecessors, (248), 17 states have return successors, (249), 18 states have call predecessors, (249), 18 states have call successors, (249) Word has length 593 [2025-03-04 00:32:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:18,705 INFO L225 Difference]: With dead ends: 12341 [2025-03-04 00:32:18,705 INFO L226 Difference]: Without dead ends: 9731 [2025-03-04 00:32:18,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10091 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7249, Invalid=28283, Unknown=0, NotChecked=0, Total=35532 [2025-03-04 00:32:18,718 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 9445 mSDsluCounter, 7031 mSDsCounter, 0 mSdLazyCounter, 10336 mSolverCounterSat, 2330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9465 SdHoareTripleChecker+Valid, 7579 SdHoareTripleChecker+Invalid, 12666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2330 IncrementalHoareTripleChecker+Valid, 10336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:18,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9465 Valid, 7579 Invalid, 12666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2330 Valid, 10336 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-04 00:32:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2025-03-04 00:32:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 4479. [2025-03-04 00:32:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 3562 states have (on average 1.424480628860191) internal successors, (5074), 3576 states have internal predecessors, (5074), 702 states have call successors, (702), 214 states have call predecessors, (702), 214 states have return successors, (702), 688 states have call predecessors, (702), 702 states have call successors, (702) [2025-03-04 00:32:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 6478 transitions. [2025-03-04 00:32:19,279 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 6478 transitions. Word has length 593 [2025-03-04 00:32:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:19,280 INFO L471 AbstractCegarLoop]: Abstraction has 4479 states and 6478 transitions. [2025-03-04 00:32:19,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 6.242424242424242) internal successors, (412), 65 states have internal predecessors, (412), 18 states have call successors, (248), 7 states have call predecessors, (248), 17 states have return successors, (249), 18 states have call predecessors, (249), 18 states have call successors, (249) [2025-03-04 00:32:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 6478 transitions. [2025-03-04 00:32:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-04 00:32:19,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:19,284 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:19,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 00:32:19,484 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,SelfDestructingSolverStorable13 [2025-03-04 00:32:19,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:19,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash -437597507, now seen corresponding path program 1 times [2025-03-04 00:32:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108595990] [2025-03-04 00:32:19,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:19,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes.