./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-49.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_fillercode_fillercodesize_ps-cn-500_file-49.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 64bf7cfb32d6aedb6c2672e68930c45a098bdd68cdd0e4d07a70ee76b55bcc1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:42,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:42,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:42,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:42,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:42,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:42,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:42,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:42,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:42,886 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:42,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:42,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:42,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:42,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:42,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:42,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:42,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:42,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:42,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:42,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:42,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:42,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:42,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:42,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:42,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:42,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:42,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:42,891 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 -> 64bf7cfb32d6aedb6c2672e68930c45a098bdd68cdd0e4d07a70ee76b55bcc1e [2025-03-03 20:08:43,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:43,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:43,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:43,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:43,119 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:43,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-49.i [2025-03-03 20:08:44,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b7a7360/5ed1ae21e4fc4c54acd1e8c261f967e7/FLAGf03f874db [2025-03-03 20:08:44,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:44,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-49.i [2025-03-03 20:08:44,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b7a7360/5ed1ae21e4fc4c54acd1e8c261f967e7/FLAGf03f874db [2025-03-03 20:08:44,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b7a7360/5ed1ae21e4fc4c54acd1e8c261f967e7 [2025-03-03 20:08:44,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:44,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:44,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:44,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:44,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:44,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:44" (1/1) ... [2025-03-03 20:08:44,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b976683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:44, skipping insertion in model container [2025-03-03 20:08:44,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:44" (1/1) ... [2025-03-03 20:08:44,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:44,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-49.i[916,929] [2025-03-03 20:08:45,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:45,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:45,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-49.i[916,929] [2025-03-03 20:08:45,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:45,208 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:45,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45 WrapperNode [2025-03-03 20:08:45,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:45,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:45,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:45,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:45,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,290 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 795 [2025-03-03 20:08:45,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:45,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:45,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:45,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:45,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,343 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-03 20:08:45,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:45,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:45,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:45,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:45,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (1/1) ... [2025-03-03 20:08:45,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:45,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:45,440 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-03 20:08:45,442 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-03 20:08:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:45,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:45,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:45,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:45,590 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:46,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc property_#t~bitwise73#1;havoc property_#t~short74#1; [2025-03-03 20:08:46,553 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:46,554 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:46,585 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:46,589 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:08:46,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:46 BoogieIcfgContainer [2025-03-03 20:08:46,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:46,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:46,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:46,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:46,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:44" (1/3) ... [2025-03-03 20:08:46,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e028164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:46, skipping insertion in model container [2025-03-03 20:08:46,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:45" (2/3) ... [2025-03-03 20:08:46,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e028164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:46, skipping insertion in model container [2025-03-03 20:08:46,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:46" (3/3) ... [2025-03-03 20:08:46,597 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-49.i [2025-03-03 20:08:46,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:46,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-49.i that has 2 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:08:46,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:46,679 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;@2c20434b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:46,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 221 states have (on average 1.588235294117647) internal successors, (351), 222 states have internal predecessors, (351), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:08:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-03 20:08:46,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:46,715 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:46,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -107678604, now seen corresponding path program 1 times [2025-03-03 20:08:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:46,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941047185] [2025-03-03 20:08:46,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:08:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:08:46,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:46,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:08:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:47,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941047185] [2025-03-03 20:08:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941047185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129237348] [2025-03-03 20:08:47,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:47,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:47,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:47,293 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-03 20:08:47,295 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-03 20:08:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-03 20:08:47,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-03 20:08:47,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:47,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:08:47,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-03 20:08:47,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:47,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129237348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:47,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:47,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:08:47,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304720590] [2025-03-03 20:08:47,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:47,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:47,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:47,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:47,776 INFO L87 Difference]: Start difference. First operand has 326 states, 221 states have (on average 1.588235294117647) internal successors, (351), 222 states have internal predecessors, (351), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:08:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:47,847 INFO L93 Difference]: Finished difference Result 645 states and 1205 transitions. [2025-03-03 20:08:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:47,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 660 [2025-03-03 20:08:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:47,856 INFO L225 Difference]: With dead ends: 645 [2025-03-03 20:08:47,857 INFO L226 Difference]: Without dead ends: 322 [2025-03-03 20:08:47,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 661 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-03 20:08:47,869 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:47,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-03 20:08:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-03-03 20:08:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 218 states have internal predecessors, (338), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:08:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 542 transitions. [2025-03-03 20:08:47,955 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 542 transitions. Word has length 660 [2025-03-03 20:08:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 542 transitions. [2025-03-03 20:08:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:08:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 542 transitions. [2025-03-03 20:08:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 20:08:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:47,973 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:47,985 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-03 20:08:48,177 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-03 20:08:48,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1454925927, now seen corresponding path program 1 times [2025-03-03 20:08:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034294797] [2025-03-03 20:08:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:48,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 20:08:48,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 20:08:48,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:48,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034294797] [2025-03-03 20:08:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034294797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467114214] [2025-03-03 20:08:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:48,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:48,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:48,943 INFO L87 Difference]: Start difference. First operand 322 states and 542 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:49,059 INFO L93 Difference]: Finished difference Result 836 states and 1412 transitions. [2025-03-03 20:08:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 661 [2025-03-03 20:08:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:49,070 INFO L225 Difference]: With dead ends: 836 [2025-03-03 20:08:49,070 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 20:08:49,071 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-03 20:08:49,072 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 333 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:49,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1164 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 20:08:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 514. [2025-03-03 20:08:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 372 states have (on average 1.5672043010752688) internal successors, (583), 373 states have internal predecessors, (583), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-03 20:08:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 861 transitions. [2025-03-03 20:08:49,126 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 861 transitions. Word has length 661 [2025-03-03 20:08:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:49,128 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 861 transitions. [2025-03-03 20:08:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 861 transitions. [2025-03-03 20:08:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-03 20:08:49,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:49,139 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:08:49,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1656770878, now seen corresponding path program 1 times [2025-03-03 20:08:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216736992] [2025-03-03 20:08:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:49,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-03 20:08:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-03 20:08:49,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:49,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216736992] [2025-03-03 20:08:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216736992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:49,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:49,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:49,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141549761] [2025-03-03 20:08:49,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:49,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:49,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:49,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:49,585 INFO L87 Difference]: Start difference. First operand 514 states and 861 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:49,990 INFO L93 Difference]: Finished difference Result 1538 states and 2581 transitions. [2025-03-03 20:08:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:49,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 662 [2025-03-03 20:08:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:50,005 INFO L225 Difference]: With dead ends: 1538 [2025-03-03 20:08:50,006 INFO L226 Difference]: Without dead ends: 1027 [2025-03-03 20:08:50,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 20:08:50,011 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 525 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:50,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2115 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-03 20:08:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 563. [2025-03-03 20:08:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 421 states have (on average 1.5985748218527316) internal successors, (673), 422 states have internal predecessors, (673), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-03 20:08:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 951 transitions. [2025-03-03 20:08:50,088 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 951 transitions. Word has length 662 [2025-03-03 20:08:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:50,089 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 951 transitions. [2025-03-03 20:08:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 951 transitions. [2025-03-03 20:08:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:50,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:50,095 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:50,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:08:50,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1770207867, now seen corresponding path program 1 times [2025-03-03 20:08:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:50,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132334705] [2025-03-03 20:08:50,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:50,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:50,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:50,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:50,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:50,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132334705] [2025-03-03 20:08:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132334705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:50,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809143833] [2025-03-03 20:08:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:50,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:50,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:50,517 INFO L87 Difference]: Start difference. First operand 563 states and 951 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:50,839 INFO L93 Difference]: Finished difference Result 1685 states and 2851 transitions. [2025-03-03 20:08:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:08:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:50,846 INFO L225 Difference]: With dead ends: 1685 [2025-03-03 20:08:50,846 INFO L226 Difference]: Without dead ends: 1125 [2025-03-03 20:08:50,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 20:08:50,849 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 319 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:50,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1363 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-03-03 20:08:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2025-03-03 20:08:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 840 states have (on average 1.6) internal successors, (1344), 842 states have internal predecessors, (1344), 278 states have call successors, (278), 4 states have call predecessors, (278), 4 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-03 20:08:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1900 transitions. [2025-03-03 20:08:50,947 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1900 transitions. Word has length 663 [2025-03-03 20:08:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:50,948 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1900 transitions. [2025-03-03 20:08:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1900 transitions. [2025-03-03 20:08:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:50,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:50,956 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:50,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:08:50,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:50,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:50,957 INFO L85 PathProgramCache]: Analyzing trace with hash 514655588, now seen corresponding path program 1 times [2025-03-03 20:08:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717727925] [2025-03-03 20:08:50,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:50,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:51,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:51,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:51,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717727925] [2025-03-03 20:08:51,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717727925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:51,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057540889] [2025-03-03 20:08:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:51,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:51,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:51,195 INFO L87 Difference]: Start difference. First operand 1123 states and 1900 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:51,302 INFO L93 Difference]: Finished difference Result 2275 states and 3838 transitions. [2025-03-03 20:08:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:08:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:51,312 INFO L225 Difference]: With dead ends: 2275 [2025-03-03 20:08:51,313 INFO L226 Difference]: Without dead ends: 1155 [2025-03-03 20:08:51,316 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-03 20:08:51,318 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 281 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:51,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1106 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-03 20:08:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 949. [2025-03-03 20:08:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 740 states have (on average 1.6081081081081081) internal successors, (1190), 740 states have internal predecessors, (1190), 204 states have call successors, (204), 4 states have call predecessors, (204), 4 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-03 20:08:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1598 transitions. [2025-03-03 20:08:51,373 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1598 transitions. Word has length 663 [2025-03-03 20:08:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:51,376 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1598 transitions. [2025-03-03 20:08:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1598 transitions. [2025-03-03 20:08:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:51,383 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:08:51,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:51,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 259919043, now seen corresponding path program 1 times [2025-03-03 20:08:51,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:51,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948256777] [2025-03-03 20:08:51,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:51,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:51,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:51,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:52,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948256777] [2025-03-03 20:08:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948256777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:08:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536430734] [2025-03-03 20:08:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:52,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:08:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:52,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:08:52,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:08:52,861 INFO L87 Difference]: Start difference. First operand 949 states and 1598 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:56,834 INFO L93 Difference]: Finished difference Result 8144 states and 13707 transitions. [2025-03-03 20:08:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:08:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:08:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:56,861 INFO L225 Difference]: With dead ends: 8144 [2025-03-03 20:08:56,862 INFO L226 Difference]: Without dead ends: 7198 [2025-03-03 20:08:56,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2025-03-03 20:08:56,867 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 5408 mSDsluCounter, 4894 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 1073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5408 SdHoareTripleChecker+Valid, 5418 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1073 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:56,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5408 Valid, 5418 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1073 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 20:08:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2025-03-03 20:08:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 2429. [2025-03-03 20:08:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2084 states have (on average 1.663147792706334) internal successors, (3466), 2088 states have internal predecessors, (3466), 332 states have call successors, (332), 12 states have call predecessors, (332), 12 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-03 20:08:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 4130 transitions. [2025-03-03 20:08:57,017 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 4130 transitions. Word has length 663 [2025-03-03 20:08:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:57,019 INFO L471 AbstractCegarLoop]: Abstraction has 2429 states and 4130 transitions. [2025-03-03 20:08:57,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 4130 transitions. [2025-03-03 20:08:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:57,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:57,025 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:57,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:08:57,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:57,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash 589684804, now seen corresponding path program 1 times [2025-03-03 20:08:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:57,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835972946] [2025-03-03 20:08:57,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:57,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:57,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:57,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:57,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835972946] [2025-03-03 20:08:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835972946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:08:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468591487] [2025-03-03 20:08:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:57,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:57,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:57,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:57,798 INFO L87 Difference]: Start difference. First operand 2429 states and 4130 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:58,781 INFO L93 Difference]: Finished difference Result 5860 states and 9965 transitions. [2025-03-03 20:08:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:08:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:08:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:58,801 INFO L225 Difference]: With dead ends: 5860 [2025-03-03 20:08:58,802 INFO L226 Difference]: Without dead ends: 3434 [2025-03-03 20:08:58,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:58,808 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2132 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:58,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 2034 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:08:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-03-03 20:08:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 1948. [2025-03-03 20:08:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1479 states have (on average 1.5801217038539555) internal successors, (2337), 1482 states have internal predecessors, (2337), 451 states have call successors, (451), 17 states have call predecessors, (451), 17 states have return successors, (451), 448 states have call predecessors, (451), 451 states have call successors, (451) [2025-03-03 20:08:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 3239 transitions. [2025-03-03 20:08:58,964 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 3239 transitions. Word has length 663 [2025-03-03 20:08:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:58,965 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 3239 transitions. [2025-03-03 20:08:58,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:08:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 3239 transitions. [2025-03-03 20:08:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:08:58,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:58,983 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:08:58,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:58,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:58,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 500459172, now seen corresponding path program 1 times [2025-03-03 20:08:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097514132] [2025-03-03 20:08:58,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:59,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:08:59,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:08:59,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:59,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:08:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097514132] [2025-03-03 20:08:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097514132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:08:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818659654] [2025-03-03 20:08:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:59,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:59,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:59,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:59,631 INFO L87 Difference]: Start difference. First operand 1948 states and 3239 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:00,502 INFO L93 Difference]: Finished difference Result 6822 states and 11276 transitions. [2025-03-03 20:09:00,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:09:00,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:09:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:00,524 INFO L225 Difference]: With dead ends: 6822 [2025-03-03 20:09:00,524 INFO L226 Difference]: Without dead ends: 4958 [2025-03-03 20:09:00,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:09:00,531 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 828 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 3234 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:00,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 3234 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:09:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2025-03-03 20:09:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 3690. [2025-03-03 20:09:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 2561 states have (on average 1.4896524795001953) internal successors, (3815), 2572 states have internal predecessors, (3815), 1081 states have call successors, (1081), 47 states have call predecessors, (1081), 47 states have return successors, (1081), 1070 states have call predecessors, (1081), 1081 states have call successors, (1081) [2025-03-03 20:09:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5977 transitions. [2025-03-03 20:09:00,866 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5977 transitions. Word has length 663 [2025-03-03 20:09:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:00,867 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 5977 transitions. [2025-03-03 20:09:00,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5977 transitions. [2025-03-03 20:09:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-03-03 20:09:00,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:00,874 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:09:00,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2008010981, now seen corresponding path program 1 times [2025-03-03 20:09:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398391175] [2025-03-03 20:09:00,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:00,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-03-03 20:09:01,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-03-03 20:09:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:09:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398391175] [2025-03-03 20:09:01,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398391175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:01,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:01,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:09:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007077233] [2025-03-03 20:09:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:01,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:09:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:01,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:09:01,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:09:01,465 INFO L87 Difference]: Start difference. First operand 3690 states and 5977 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:02,027 INFO L93 Difference]: Finished difference Result 9102 states and 14890 transitions. [2025-03-03 20:09:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:09:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 663 [2025-03-03 20:09:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:02,065 INFO L225 Difference]: With dead ends: 9102 [2025-03-03 20:09:02,066 INFO L226 Difference]: Without dead ends: 5496 [2025-03-03 20:09:02,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:09:02,081 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 509 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:02,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1571 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:09:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2025-03-03 20:09:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5254. [2025-03-03 20:09:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 4065 states have (on average 1.5675276752767529) internal successors, (6372), 4075 states have internal predecessors, (6372), 1140 states have call successors, (1140), 48 states have call predecessors, (1140), 48 states have return successors, (1140), 1130 states have call predecessors, (1140), 1140 states have call successors, (1140) [2025-03-03 20:09:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 8652 transitions. [2025-03-03 20:09:02,445 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 8652 transitions. Word has length 663 [2025-03-03 20:09:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 8652 transitions. [2025-03-03 20:09:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 8652 transitions. [2025-03-03 20:09:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-03 20:09:02,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:02,458 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:09:02,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 179350256, now seen corresponding path program 1 times [2025-03-03 20:09:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022922364] [2025-03-03 20:09:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:02,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-03 20:09:02,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-03 20:09:02,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:09:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022922364] [2025-03-03 20:09:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022922364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:09:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609832517] [2025-03-03 20:09:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:09:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:04,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:09:04,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:09:04,158 INFO L87 Difference]: Start difference. First operand 5254 states and 8652 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:09:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:08,178 INFO L93 Difference]: Finished difference Result 21524 states and 35248 transitions. [2025-03-03 20:09:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:09:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) Word has length 664 [2025-03-03 20:09:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:08,235 INFO L225 Difference]: With dead ends: 21524 [2025-03-03 20:09:08,236 INFO L226 Difference]: Without dead ends: 17334 [2025-03-03 20:09:08,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:09:08,251 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 2662 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:08,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 2815 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 20:09:08,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17334 states. [2025-03-03 20:09:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17334 to 3738. [2025-03-03 20:09:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 3048 states have (on average 1.625) internal successors, (4953), 3052 states have internal predecessors, (4953), 652 states have call successors, (652), 37 states have call predecessors, (652), 37 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-03-03 20:09:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 6257 transitions. [2025-03-03 20:09:08,809 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 6257 transitions. Word has length 664 [2025-03-03 20:09:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 6257 transitions. [2025-03-03 20:09:08,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:09:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 6257 transitions. [2025-03-03 20:09:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-03-03 20:09:08,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:08,816 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:08,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:09:08,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:08,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash 893429231, now seen corresponding path program 1 times [2025-03-03 20:09:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627368895] [2025-03-03 20:09:08,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:08,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-03-03 20:09:08,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-03-03 20:09:08,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:08,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:09:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627368895] [2025-03-03 20:09:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627368895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:09,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:09,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:09:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336875911] [2025-03-03 20:09:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:09,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:09:09,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:09,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:09:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:09:09,110 INFO L87 Difference]: Start difference. First operand 3738 states and 6257 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:09,503 INFO L93 Difference]: Finished difference Result 6118 states and 10174 transitions. [2025-03-03 20:09:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:09:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 664 [2025-03-03 20:09:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:09,515 INFO L225 Difference]: With dead ends: 6118 [2025-03-03 20:09:09,515 INFO L226 Difference]: Without dead ends: 3744 [2025-03-03 20:09:09,521 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-03 20:09:09,522 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:09,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1055 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:09:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2025-03-03 20:09:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3744. [2025-03-03 20:09:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3054 states have (on average 1.6237721021611002) internal successors, (4959), 3058 states have internal predecessors, (4959), 652 states have call successors, (652), 37 states have call predecessors, (652), 37 states have return successors, (652), 648 states have call predecessors, (652), 652 states have call successors, (652) [2025-03-03 20:09:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 6263 transitions. [2025-03-03 20:09:09,821 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 6263 transitions. Word has length 664 [2025-03-03 20:09:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:09,821 INFO L471 AbstractCegarLoop]: Abstraction has 3744 states and 6263 transitions. [2025-03-03 20:09:09,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 6263 transitions. [2025-03-03 20:09:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 20:09:09,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:09,827 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:09:09,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash -783054936, now seen corresponding path program 1 times [2025-03-03 20:09:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185380288] [2025-03-03 20:09:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:09,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 20:09:10,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 20:09:10,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:09:11,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:11,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185380288] [2025-03-03 20:09:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185380288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:09:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107700882] [2025-03-03 20:09:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:09:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:11,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:09:11,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:09:11,612 INFO L87 Difference]: Start difference. First operand 3744 states and 6263 transitions. Second operand has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:09:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:14,667 INFO L93 Difference]: Finished difference Result 17715 states and 29785 transitions. [2025-03-03 20:09:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:09:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) Word has length 665 [2025-03-03 20:09:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:14,700 INFO L225 Difference]: With dead ends: 17715 [2025-03-03 20:09:14,700 INFO L226 Difference]: Without dead ends: 15196 [2025-03-03 20:09:14,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:09:14,708 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 3519 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 4077 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:14,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3519 Valid, 4077 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:09:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15196 states. [2025-03-03 20:09:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15196 to 5979. [2025-03-03 20:09:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5979 states, 5138 states have (on average 1.652783184118334) internal successors, (8492), 5148 states have internal predecessors, (8492), 790 states have call successors, (790), 50 states have call predecessors, (790), 50 states have return successors, (790), 780 states have call predecessors, (790), 790 states have call successors, (790) [2025-03-03 20:09:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 10072 transitions. [2025-03-03 20:09:15,377 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 10072 transitions. Word has length 665 [2025-03-03 20:09:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 5979 states and 10072 transitions. [2025-03-03 20:09:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 12 states have internal predecessors, (158), 2 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 2 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-03 20:09:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 10072 transitions. [2025-03-03 20:09:15,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 20:09:15,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:15,385 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:15,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:09:15,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:15,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1071290601, now seen corresponding path program 1 times [2025-03-03 20:09:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:15,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158032336] [2025-03-03 20:09:15,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 20:09:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 20:09:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158032336] [2025-03-03 20:09:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158032336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139140371] [2025-03-03 20:09:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:15,874 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-03 20:09:15,876 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-03 20:09:16,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 20:09:16,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 20:09:16,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:16,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:16,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:09:16,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 9851 proven. 186 refuted. 0 times theorem prover too weak. 10567 trivial. 0 not checked. [2025-03-03 20:09:16,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:09:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 117 proven. 186 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139140371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:09:17,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:09:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-03 20:09:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633970589] [2025-03-03 20:09:17,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:09:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:09:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:17,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:09:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:09:17,226 INFO L87 Difference]: Start difference. First operand 5979 states and 10072 transitions. Second operand has 10 states, 10 states have (on average 39.5) internal successors, (395), 10 states have internal predecessors, (395), 4 states have call successors, (263), 2 states have call predecessors, (263), 4 states have return successors, (265), 4 states have call predecessors, (265), 4 states have call successors, (265) [2025-03-03 20:09:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:18,427 INFO L93 Difference]: Finished difference Result 10617 states and 17672 transitions. [2025-03-03 20:09:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:09:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 39.5) internal successors, (395), 10 states have internal predecessors, (395), 4 states have call successors, (263), 2 states have call predecessors, (263), 4 states have return successors, (265), 4 states have call predecessors, (265), 4 states have call successors, (265) Word has length 665 [2025-03-03 20:09:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:18,450 INFO L225 Difference]: With dead ends: 10617 [2025-03-03 20:09:18,451 INFO L226 Difference]: Without dead ends: 6131 [2025-03-03 20:09:18,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1343 GetRequests, 1327 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:09:18,460 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 641 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:18,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 997 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:09:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2025-03-03 20:09:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5434. [2025-03-03 20:09:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 4573 states have (on average 1.6116335009840368) internal successors, (7370), 4583 states have internal predecessors, (7370), 790 states have call successors, (790), 70 states have call predecessors, (790), 70 states have return successors, (790), 780 states have call predecessors, (790), 790 states have call successors, (790) [2025-03-03 20:09:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 8950 transitions. [2025-03-03 20:09:19,006 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 8950 transitions. Word has length 665 [2025-03-03 20:09:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:19,007 INFO L471 AbstractCegarLoop]: Abstraction has 5434 states and 8950 transitions. [2025-03-03 20:09:19,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.5) internal successors, (395), 10 states have internal predecessors, (395), 4 states have call successors, (263), 2 states have call predecessors, (263), 4 states have return successors, (265), 4 states have call predecessors, (265), 4 states have call successors, (265) [2025-03-03 20:09:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 8950 transitions. [2025-03-03 20:09:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-03 20:09:19,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:19,039 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:19,048 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-03 20:09:19,239 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,SelfDestructingSolverStorable12 [2025-03-03 20:09:19,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:19,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2049536991, now seen corresponding path program 1 times [2025-03-03 20:09:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754850823] [2025-03-03 20:09:19,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:19,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-03 20:09:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-03 20:09:19,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:19,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-03 20:09:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754850823] [2025-03-03 20:09:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754850823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:09:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534830468] [2025-03-03 20:09:19,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:19,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:09:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:19,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:09:19,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:09:19,422 INFO L87 Difference]: Start difference. First operand 5434 states and 8950 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:20,572 INFO L93 Difference]: Finished difference Result 14065 states and 23004 transitions. [2025-03-03 20:09:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:09:20,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 667 [2025-03-03 20:09:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:20,600 INFO L225 Difference]: With dead ends: 14065 [2025-03-03 20:09:20,600 INFO L226 Difference]: Without dead ends: 9913 [2025-03-03 20:09:20,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 20:09:20,607 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 516 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:20,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2104 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:09:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2025-03-03 20:09:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 6143. [2025-03-03 20:09:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6143 states, 5282 states have (on average 1.6175691026126466) internal successors, (8544), 5292 states have internal predecessors, (8544), 790 states have call successors, (790), 70 states have call predecessors, (790), 70 states have return successors, (790), 780 states have call predecessors, (790), 790 states have call successors, (790) [2025-03-03 20:09:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 10124 transitions. [2025-03-03 20:09:21,337 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 10124 transitions. Word has length 667 [2025-03-03 20:09:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:21,338 INFO L471 AbstractCegarLoop]: Abstraction has 6143 states and 10124 transitions. [2025-03-03 20:09:21,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-03 20:09:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 10124 transitions. [2025-03-03 20:09:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-03-03 20:09:21,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:21,347 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:21,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:09:21,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 386679230, now seen corresponding path program 1 times [2025-03-03 20:09:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439426298] [2025-03-03 20:09:21,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-03 20:09:21,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-03 20:09:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:22,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439426298] [2025-03-03 20:09:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439426298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82967906] [2025-03-03 20:09:22,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:22,028 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-03 20:09:22,030 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-03 20:09:22,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-03-03 20:09:22,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-03-03 20:09:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:22,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:09:22,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 897 proven. 297 refuted. 0 times theorem prover too weak. 19410 trivial. 0 not checked. [2025-03-03 20:09:24,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:09:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 6 proven. 297 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82967906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:09:26,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:09:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2025-03-03 20:09:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595635876] [2025-03-03 20:09:26,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:09:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:09:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:26,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:09:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:09:26,558 INFO L87 Difference]: Start difference. First operand 6143 states and 10124 transitions. Second operand has 17 states, 17 states have (on average 27.941176470588236) internal successors, (475), 17 states have internal predecessors, (475), 6 states have call successors, (306), 3 states have call predecessors, (306), 6 states have return successors, (306), 6 states have call predecessors, (306), 6 states have call successors, (306) [2025-03-03 20:09:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:31,196 INFO L93 Difference]: Finished difference Result 23920 states and 38497 transitions. [2025-03-03 20:09:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 20:09:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 27.941176470588236) internal successors, (475), 17 states have internal predecessors, (475), 6 states have call successors, (306), 3 states have call predecessors, (306), 6 states have return successors, (306), 6 states have call predecessors, (306), 6 states have call successors, (306) Word has length 668 [2025-03-03 20:09:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:31,249 INFO L225 Difference]: With dead ends: 23920 [2025-03-03 20:09:31,249 INFO L226 Difference]: Without dead ends: 19802 [2025-03-03 20:09:31,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1370 GetRequests, 1331 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 20:09:31,263 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3225 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 2834 mSolverCounterSat, 1150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 3984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1150 IncrementalHoareTripleChecker+Valid, 2834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:31,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3328 Valid, 3973 Invalid, 3984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1150 Valid, 2834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:09:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19802 states. [2025-03-03 20:09:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19802 to 18644. [2025-03-03 20:09:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18644 states, 15521 states have (on average 1.5878487210875587) internal successors, (24645), 15561 states have internal predecessors, (24645), 2854 states have call successors, (2854), 268 states have call predecessors, (2854), 268 states have return successors, (2854), 2814 states have call predecessors, (2854), 2854 states have call successors, (2854) [2025-03-03 20:09:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18644 states to 18644 states and 30353 transitions. [2025-03-03 20:09:33,573 INFO L78 Accepts]: Start accepts. Automaton has 18644 states and 30353 transitions. Word has length 668 [2025-03-03 20:09:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:33,574 INFO L471 AbstractCegarLoop]: Abstraction has 18644 states and 30353 transitions. [2025-03-03 20:09:33,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 27.941176470588236) internal successors, (475), 17 states have internal predecessors, (475), 6 states have call successors, (306), 3 states have call predecessors, (306), 6 states have return successors, (306), 6 states have call predecessors, (306), 6 states have call successors, (306) [2025-03-03 20:09:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18644 states and 30353 transitions. [2025-03-03 20:09:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-03 20:09:33,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:33,580 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:33,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:09:33,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:33,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:33,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1404295830, now seen corresponding path program 1 times [2025-03-03 20:09:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523559307] [2025-03-03 20:09:33,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:33,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-03 20:09:33,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-03 20:09:33,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:33,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 204 proven. 99 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523559307] [2025-03-03 20:09:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523559307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167435113] [2025-03-03 20:09:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:34,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:34,215 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-03 20:09:34,217 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-03 20:09:34,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-03 20:09:34,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-03 20:09:34,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:34,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:34,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:09:34,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 8597 proven. 87 refuted. 0 times theorem prover too weak. 11920 trivial. 0 not checked. [2025-03-03 20:09:34,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:09:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 216 proven. 87 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167435113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:09:35,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:09:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 20:09:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700170032] [2025-03-03 20:09:35,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:09:35,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:09:35,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:35,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:09:35,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:09:35,291 INFO L87 Difference]: Start difference. First operand 18644 states and 30353 transitions. Second operand has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) [2025-03-03 20:09:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:36,803 INFO L93 Difference]: Finished difference Result 29363 states and 48340 transitions. [2025-03-03 20:09:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:09:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) Word has length 669 [2025-03-03 20:09:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:36,842 INFO L225 Difference]: With dead ends: 29363 [2025-03-03 20:09:36,842 INFO L226 Difference]: Without dead ends: 12338 [2025-03-03 20:09:36,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1335 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:09:36,871 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 780 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:36,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1043 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:09:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12338 states. [2025-03-03 20:09:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12338 to 12178. [2025-03-03 20:09:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12178 states, 10965 states have (on average 1.6700410396716827) internal successors, (18312), 10973 states have internal predecessors, (18312), 1102 states have call successors, (1102), 110 states have call predecessors, (1102), 110 states have return successors, (1102), 1094 states have call predecessors, (1102), 1102 states have call successors, (1102) [2025-03-03 20:09:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 20516 transitions. [2025-03-03 20:09:37,770 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 20516 transitions. Word has length 669 [2025-03-03 20:09:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:37,771 INFO L471 AbstractCegarLoop]: Abstraction has 12178 states and 20516 transitions. [2025-03-03 20:09:37,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 3 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (166), 3 states have call predecessors, (166), 3 states have call successors, (166) [2025-03-03 20:09:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 20516 transitions. [2025-03-03 20:09:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:09:37,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:37,775 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:09:37,785 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-03 20:09:37,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 20:09:37,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:37,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1142332062, now seen corresponding path program 1 times [2025-03-03 20:09:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500364038] [2025-03-03 20:09:37,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:38,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:09:38,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:09:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 75 proven. 228 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-03 20:09:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500364038] [2025-03-03 20:09:39,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500364038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488124914] [2025-03-03 20:09:39,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:39,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:09:39,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:09:39,542 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-03 20:09:39,543 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-03 20:09:39,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:09:39,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:09:39,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:39,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:39,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 20:09:39,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:09:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 7751 proven. 228 refuted. 0 times theorem prover too weak. 12625 trivial. 0 not checked. [2025-03-03 20:09:41,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:09:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488124914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:09:41,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:09:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2025-03-03 20:09:41,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382948817] [2025-03-03 20:09:41,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:09:41,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 20:09:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:41,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 20:09:41,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:09:41,887 INFO L87 Difference]: Start difference. First operand 12178 states and 20516 transitions. Second operand has 21 states, 21 states have (on average 11.0) internal successors, (231), 21 states have internal predecessors, (231), 2 states have call successors, (178), 2 states have call predecessors, (178), 3 states have return successors, (178), 2 states have call predecessors, (178), 2 states have call successors, (178)