./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 87a957337dc32d96943bc73c6af7d43fd798bbd6e6b58f7ac997d11314c3b953 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:47:50,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:47:50,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:47:50,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:47:50,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:47:51,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:47:51,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:47:51,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:47:51,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:47:51,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:47:51,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:47:51,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:47:51,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:47:51,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:47:51,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:47:51,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:47:51,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:47:51,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:51,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:47:51,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:51,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:47:51,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:47:51,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:47:51,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:47:51,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:47:51,026 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-jdk21/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 -> 87a957337dc32d96943bc73c6af7d43fd798bbd6e6b58f7ac997d11314c3b953 [2025-01-09 14:47:51,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:47:51,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:47:51,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:47:51,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:47:51,304 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:47:51,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i [2025-01-09 14:47:52,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa31371f/d20169026e104e059fc816ceb22cfeaf/FLAG4e45954b4 [2025-01-09 14:47:52,982 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:47:52,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i [2025-01-09 14:47:53,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa31371f/d20169026e104e059fc816ceb22cfeaf/FLAG4e45954b4 [2025-01-09 14:47:53,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa31371f/d20169026e104e059fc816ceb22cfeaf [2025-01-09 14:47:53,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:47:53,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:47:53,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:53,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:47:53,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:47:53,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44150f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53, skipping insertion in model container [2025-01-09 14:47:53,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:47:53,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i[916,929] [2025-01-09 14:47:53,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:53,534 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:47:53,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-52.i[916,929] [2025-01-09 14:47:53,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:47:53,668 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:47:53,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53 WrapperNode [2025-01-09 14:47:53,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:47:53,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:53,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:47:53,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:47:53,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,830 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 801 [2025-01-09 14:47:53,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:47:53,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:47:53,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:47:53,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:47:53,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,957 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-01-09 14:47:53,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:53,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:54,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:54,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:54,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:54,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:47:54,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:47:54,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:47:54,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:47:54,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (1/1) ... [2025-01-09 14:47:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:47:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:54,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:47:54,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:47:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:47:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:47:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:47:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:47:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:47:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:47:54,289 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:47:54,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:47:55,677 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-01-09 14:47:55,678 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:47:55,693 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:47:55,694 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:47:55,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:55 BoogieIcfgContainer [2025-01-09 14:47:55,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:47:55,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:47:55,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:47:55,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:47:55,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:53" (1/3) ... [2025-01-09 14:47:55,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55ba10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:55, skipping insertion in model container [2025-01-09 14:47:55,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:53" (2/3) ... [2025-01-09 14:47:55,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a55ba10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:55, skipping insertion in model container [2025-01-09 14:47:55,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:55" (3/3) ... [2025-01-09 14:47:55,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-52.i [2025-01-09 14:47:55,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:47:55,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-52.i that has 2 procedures, 317 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:47:55,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:47:55,817 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;@69d259a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:47:55,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:47:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 248 states have (on average 1.5362903225806452) internal successors, (381), 249 states have internal predecessors, (381), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:47:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:47:55,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:55,856 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:55,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 713872473, now seen corresponding path program 1 times [2025-01-09 14:47:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339617954] [2025-01-09 14:47:55,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:56,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:47:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:47:56,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:56,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-01-09 14:47:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339617954] [2025-01-09 14:47:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339617954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922437342] [2025-01-09 14:47:56,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:56,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:47:56,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:47:57,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:47:57,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:57,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:47:57,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-01-09 14:47:57,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:57,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922437342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:57,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:57,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:47:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612214282] [2025-01-09 14:47:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:57,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:47:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:57,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:47:57,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:47:57,244 INFO L87 Difference]: Start difference. First operand has 317 states, 248 states have (on average 1.5362903225806452) internal successors, (381), 249 states have internal predecessors, (381), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-01-09 14:47:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:57,297 INFO L93 Difference]: Finished difference Result 628 states and 1087 transitions. [2025-01-09 14:47:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:47:57,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 483 [2025-01-09 14:47:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:57,305 INFO L225 Difference]: With dead ends: 628 [2025-01-09 14:47:57,306 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 14:47:57,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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-01-09 14:47:57,313 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:57,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 14:47:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-01-09 14:47:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.5284552845528456) internal successors, (376), 246 states have internal predecessors, (376), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:47:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 508 transitions. [2025-01-09 14:47:57,382 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 508 transitions. Word has length 483 [2025-01-09 14:47:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:57,382 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 508 transitions. [2025-01-09 14:47:57,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-01-09 14:47:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 508 transitions. [2025-01-09 14:47:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:47:57,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:57,396 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:57,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:47:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:47:57,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1310770677, now seen corresponding path program 1 times [2025-01-09 14:47:57,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484583229] [2025-01-09 14:47:57,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:57,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:47:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:47:57,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:57,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:47:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:58,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484583229] [2025-01-09 14:47:58,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484583229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:58,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894195760] [2025-01-09 14:47:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:58,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:58,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:58,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:58,379 INFO L87 Difference]: Start difference. First operand 314 states and 508 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:47:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:58,490 INFO L93 Difference]: Finished difference Result 933 states and 1513 transitions. [2025-01-09 14:47:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:58,491 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-01-09 14:47:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:58,502 INFO L225 Difference]: With dead ends: 933 [2025-01-09 14:47:58,502 INFO L226 Difference]: Without dead ends: 622 [2025-01-09 14:47:58,504 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-01-09 14:47:58,506 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 495 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:58,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 998 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-01-09 14:47:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 405. [2025-01-09 14:47:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 14:47:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 663 transitions. [2025-01-09 14:47:58,573 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 663 transitions. Word has length 483 [2025-01-09 14:47:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:58,577 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 663 transitions. [2025-01-09 14:47:58,578 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:47:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 663 transitions. [2025-01-09 14:47:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:47:58,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:58,586 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:58,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:47:58,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:58,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438669, now seen corresponding path program 1 times [2025-01-09 14:47:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144038842] [2025-01-09 14:47:58,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:58,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:47:58,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:47:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:47:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:59,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144038842] [2025-01-09 14:47:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144038842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370068391] [2025-01-09 14:47:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:59,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:59,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:59,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:59,055 INFO L87 Difference]: Start difference. First operand 405 states and 663 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:47:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,182 INFO L93 Difference]: Finished difference Result 1203 states and 1971 transitions. [2025-01-09 14:47:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:59,184 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-01-09 14:47:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,193 INFO L225 Difference]: With dead ends: 1203 [2025-01-09 14:47:59,195 INFO L226 Difference]: Without dead ends: 801 [2025-01-09 14:47:59,197 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-01-09 14:47:59,198 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 494 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 993 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:47:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-01-09 14:47:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2025-01-09 14:47:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 664 states have (on average 1.5677710843373494) internal successors, (1041), 664 states have internal predecessors, (1041), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 14:47:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1305 transitions. [2025-01-09 14:47:59,290 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1305 transitions. Word has length 483 [2025-01-09 14:47:59,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:59,291 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1305 transitions. [2025-01-09 14:47:59,292 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:47:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1305 transitions. [2025-01-09 14:47:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:47:59,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:59,304 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:59,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:47:59,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:59,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1401919951, now seen corresponding path program 1 times [2025-01-09 14:47:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:59,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304584691] [2025-01-09 14:47:59,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:59,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:47:59,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:47:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:47:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304584691] [2025-01-09 14:47:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304584691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:47:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983699814] [2025-01-09 14:47:59,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:59,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:47:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:59,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:47:59,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:47:59,760 INFO L87 Difference]: Start difference. First operand 799 states and 1305 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:47:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:59,868 INFO L93 Difference]: Finished difference Result 2391 states and 3909 transitions. [2025-01-09 14:47:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:47:59,869 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-01-09 14:47:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:59,885 INFO L225 Difference]: With dead ends: 2391 [2025-01-09 14:47:59,886 INFO L226 Difference]: Without dead ends: 1595 [2025-01-09 14:47:59,890 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-01-09 14:47:59,891 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 466 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:59,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1272 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:47:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-01-09 14:48:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1593. [2025-01-09 14:48:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1324 states have (on average 1.5649546827794563) internal successors, (2072), 1324 states have internal predecessors, (2072), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2025-01-09 14:48:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2600 transitions. [2025-01-09 14:48:00,060 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2600 transitions. Word has length 483 [2025-01-09 14:48:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:00,062 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2600 transitions. [2025-01-09 14:48:00,063 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2600 transitions. [2025-01-09 14:48:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 14:48:00,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:00,074 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:48:00,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1379287697, now seen corresponding path program 1 times [2025-01-09 14:48:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281585532] [2025-01-09 14:48:00,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:00,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 14:48:00,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 14:48:00,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:00,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281585532] [2025-01-09 14:48:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281585532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:00,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948197518] [2025-01-09 14:48:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:00,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:00,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:00,682 INFO L87 Difference]: Start difference. First operand 1593 states and 2600 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:00,750 INFO L93 Difference]: Finished difference Result 3191 states and 5213 transitions. [2025-01-09 14:48:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:00,751 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 483 [2025-01-09 14:48:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:00,763 INFO L225 Difference]: With dead ends: 3191 [2025-01-09 14:48:00,764 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 14:48:00,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:00,771 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:00,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1008 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 14:48:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-01-09 14:48:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1332 states have (on average 1.5615615615615615) internal successors, (2080), 1332 states have internal predecessors, (2080), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2025-01-09 14:48:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2608 transitions. [2025-01-09 14:48:00,915 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2608 transitions. Word has length 483 [2025-01-09 14:48:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:00,918 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2608 transitions. [2025-01-09 14:48:00,918 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, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2608 transitions. [2025-01-09 14:48:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:48:00,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:00,931 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:48:00,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1893474961, now seen corresponding path program 1 times [2025-01-09 14:48:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145770384] [2025-01-09 14:48:00,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:48:01,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:48:01,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:01,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145770384] [2025-01-09 14:48:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145770384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:48:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537938066] [2025-01-09 14:48:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:02,456 INFO L87 Difference]: Start difference. First operand 1601 states and 2608 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-01-09 14:48:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:03,479 INFO L93 Difference]: Finished difference Result 5675 states and 9287 transitions. [2025-01-09 14:48:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:48:03,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) Word has length 484 [2025-01-09 14:48:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:03,505 INFO L225 Difference]: With dead ends: 5675 [2025-01-09 14:48:03,505 INFO L226 Difference]: Without dead ends: 4077 [2025-01-09 14:48:03,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:48:03,513 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1870 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1870 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:03,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1870 Valid, 2441 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:48:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2025-01-09 14:48:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 3405. [2025-01-09 14:48:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 2868 states have (on average 1.5697350069735008) internal successors, (4502), 2868 states have internal predecessors, (4502), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2025-01-09 14:48:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5558 transitions. [2025-01-09 14:48:03,720 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5558 transitions. Word has length 484 [2025-01-09 14:48:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:03,721 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 5558 transitions. [2025-01-09 14:48:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 states have internal predecessors, (157), 3 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2025-01-09 14:48:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5558 transitions. [2025-01-09 14:48:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:48:03,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:03,731 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:03,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:48:03,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:03,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 506689551, now seen corresponding path program 1 times [2025-01-09 14:48:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122515335] [2025-01-09 14:48:03,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:03,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:48:03,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:48:03,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:05,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:05,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122515335] [2025-01-09 14:48:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122515335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:48:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546400729] [2025-01-09 14:48:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:05,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:48:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:05,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:48:05,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:48:05,724 INFO L87 Difference]: Start difference. First operand 3405 states and 5558 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:06,994 INFO L93 Difference]: Finished difference Result 12089 states and 19842 transitions. [2025-01-09 14:48:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:48:06,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 484 [2025-01-09 14:48:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:07,033 INFO L225 Difference]: With dead ends: 12089 [2025-01-09 14:48:07,034 INFO L226 Difference]: Without dead ends: 8687 [2025-01-09 14:48:07,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:48:07,046 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 1098 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:07,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 3503 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:48:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8687 states. [2025-01-09 14:48:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8687 to 5145. [2025-01-09 14:48:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5145 states, 4608 states have (on average 1.6128472222222223) internal successors, (7432), 4608 states have internal predecessors, (7432), 528 states have call successors, (528), 8 states have call predecessors, (528), 8 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2025-01-09 14:48:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5145 states to 5145 states and 8488 transitions. [2025-01-09 14:48:07,328 INFO L78 Accepts]: Start accepts. Automaton has 5145 states and 8488 transitions. Word has length 484 [2025-01-09 14:48:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:07,329 INFO L471 AbstractCegarLoop]: Abstraction has 5145 states and 8488 transitions. [2025-01-09 14:48:07,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5145 states and 8488 transitions. [2025-01-09 14:48:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-09 14:48:07,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:07,340 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:07,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:48:07,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash 625131025, now seen corresponding path program 1 times [2025-01-09 14:48:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116831487] [2025-01-09 14:48:07,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:07,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:07,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-09 14:48:07,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-09 14:48:07,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:07,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:08,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116831487] [2025-01-09 14:48:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116831487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:08,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:08,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109126222] [2025-01-09 14:48:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:08,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:08,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:08,600 INFO L87 Difference]: Start difference. First operand 5145 states and 8488 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:08,875 INFO L93 Difference]: Finished difference Result 7446 states and 12234 transitions. [2025-01-09 14:48:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 484 [2025-01-09 14:48:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:08,889 INFO L225 Difference]: With dead ends: 7446 [2025-01-09 14:48:08,890 INFO L226 Difference]: Without dead ends: 2304 [2025-01-09 14:48:08,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:08,901 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 311 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:08,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1073 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:48:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2025-01-09 14:48:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1617. [2025-01-09 14:48:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1344 states have (on average 1.5505952380952381) internal successors, (2084), 1344 states have internal predecessors, (2084), 264 states have call successors, (264), 8 states have call predecessors, (264), 8 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2025-01-09 14:48:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2612 transitions. [2025-01-09 14:48:09,035 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2612 transitions. Word has length 484 [2025-01-09 14:48:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2612 transitions. [2025-01-09 14:48:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2612 transitions. [2025-01-09 14:48:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 14:48:09,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:09,042 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:48:09,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:09,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2091734260, now seen corresponding path program 1 times [2025-01-09 14:48:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218701230] [2025-01-09 14:48:09,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:09,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 14:48:09,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 14:48:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:10,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:10,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218701230] [2025-01-09 14:48:10,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218701230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:10,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:10,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:48:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604072034] [2025-01-09 14:48:10,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:10,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:48:10,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:10,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:48:10,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:10,116 INFO L87 Difference]: Start difference. First operand 1617 states and 2612 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:10,766 INFO L93 Difference]: Finished difference Result 6093 states and 9835 transitions. [2025-01-09 14:48:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-01-09 14:48:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:10,791 INFO L225 Difference]: With dead ends: 6093 [2025-01-09 14:48:10,792 INFO L226 Difference]: Without dead ends: 4479 [2025-01-09 14:48:10,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:10,799 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 770 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:10,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1954 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:48:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2025-01-09 14:48:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 3929. [2025-01-09 14:48:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3484 states have (on average 1.5803673938002296) internal successors, (5506), 3488 states have internal predecessors, (5506), 428 states have call successors, (428), 16 states have call predecessors, (428), 16 states have return successors, (428), 424 states have call predecessors, (428), 428 states have call successors, (428) [2025-01-09 14:48:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 6362 transitions. [2025-01-09 14:48:11,059 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 6362 transitions. Word has length 485 [2025-01-09 14:48:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:11,060 INFO L471 AbstractCegarLoop]: Abstraction has 3929 states and 6362 transitions. [2025-01-09 14:48:11,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 6362 transitions. [2025-01-09 14:48:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 14:48:11,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:11,071 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:48:11,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:11,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash 61372558, now seen corresponding path program 1 times [2025-01-09 14:48:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242692782] [2025-01-09 14:48:11,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:11,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 14:48:11,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 14:48:11,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:11,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242692782] [2025-01-09 14:48:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242692782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637212653] [2025-01-09 14:48:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:11,287 INFO L87 Difference]: Start difference. First operand 3929 states and 6362 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:11,452 INFO L93 Difference]: Finished difference Result 7877 states and 12738 transitions. [2025-01-09 14:48:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-01-09 14:48:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:11,475 INFO L225 Difference]: With dead ends: 7877 [2025-01-09 14:48:11,476 INFO L226 Difference]: Without dead ends: 3951 [2025-01-09 14:48:11,486 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-01-09 14:48:11,486 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 429 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:11,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1312 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-01-09 14:48:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2533. [2025-01-09 14:48:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2256 states have (on average 1.577127659574468) internal successors, (3558), 2256 states have internal predecessors, (3558), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2025-01-09 14:48:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4086 transitions. [2025-01-09 14:48:11,636 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4086 transitions. Word has length 485 [2025-01-09 14:48:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:11,637 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4086 transitions. [2025-01-09 14:48:11,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4086 transitions. [2025-01-09 14:48:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 14:48:11,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:11,643 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:11,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:48:11,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:11,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1958869324, now seen corresponding path program 1 times [2025-01-09 14:48:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424770171] [2025-01-09 14:48:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:11,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 14:48:12,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 14:48:12,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424770171] [2025-01-09 14:48:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424770171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228432556] [2025-01-09 14:48:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:12,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:12,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:12,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:12,589 INFO L87 Difference]: Start difference. First operand 2533 states and 4086 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:13,193 INFO L93 Difference]: Finished difference Result 10429 states and 16830 transitions. [2025-01-09 14:48:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-01-09 14:48:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:13,223 INFO L225 Difference]: With dead ends: 10429 [2025-01-09 14:48:13,224 INFO L226 Difference]: Without dead ends: 7899 [2025-01-09 14:48:13,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:13,234 INFO L435 NwaCegarLoop]: 1092 mSDtfsCounter, 1381 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:13,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 2851 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:48:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7899 states. [2025-01-09 14:48:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7899 to 5125. [2025-01-09 14:48:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 4572 states have (on average 1.5678040244969378) internal successors, (7168), 4572 states have internal predecessors, (7168), 528 states have call successors, (528), 24 states have call predecessors, (528), 24 states have return successors, (528), 528 states have call predecessors, (528), 528 states have call successors, (528) [2025-01-09 14:48:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 8224 transitions. [2025-01-09 14:48:13,536 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 8224 transitions. Word has length 485 [2025-01-09 14:48:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 5125 states and 8224 transitions. [2025-01-09 14:48:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 8224 transitions. [2025-01-09 14:48:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-09 14:48:13,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:13,547 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:48:13,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -432845232, now seen corresponding path program 1 times [2025-01-09 14:48:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731625324] [2025-01-09 14:48:13,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:13,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-01-09 14:48:13,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-01-09 14:48:13,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:13,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731625324] [2025-01-09 14:48:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731625324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:14,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:14,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547462240] [2025-01-09 14:48:14,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:14,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:14,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:14,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:14,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:14,495 INFO L87 Difference]: Start difference. First operand 5125 states and 8224 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:15,503 INFO L93 Difference]: Finished difference Result 19117 states and 30620 transitions. [2025-01-09 14:48:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:15,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 485 [2025-01-09 14:48:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:15,553 INFO L225 Difference]: With dead ends: 19117 [2025-01-09 14:48:15,554 INFO L226 Difference]: Without dead ends: 13995 [2025-01-09 14:48:15,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:15,572 INFO L435 NwaCegarLoop]: 1197 mSDtfsCounter, 1409 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:15,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3035 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:48:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2025-01-09 14:48:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 8481. [2025-01-09 14:48:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 7376 states have (on average 1.5455531453362257) internal successors, (11400), 7376 states have internal predecessors, (11400), 1056 states have call successors, (1056), 48 states have call predecessors, (1056), 48 states have return successors, (1056), 1056 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-01-09 14:48:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 13512 transitions. [2025-01-09 14:48:16,205 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 13512 transitions. Word has length 485 [2025-01-09 14:48:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:16,206 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 13512 transitions. [2025-01-09 14:48:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 13512 transitions. [2025-01-09 14:48:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:48:16,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:16,218 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:16,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:48:16,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:16,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1504069121, now seen corresponding path program 1 times [2025-01-09 14:48:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877130292] [2025-01-09 14:48:16,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:48:16,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:48:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:17,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:17,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877130292] [2025-01-09 14:48:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877130292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:17,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:17,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042049784] [2025-01-09 14:48:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:17,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:17,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:17,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:17,153 INFO L87 Difference]: Start difference. First operand 8481 states and 13512 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:18,503 INFO L93 Difference]: Finished difference Result 22033 states and 34996 transitions. [2025-01-09 14:48:18,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:18,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-01-09 14:48:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:18,562 INFO L225 Difference]: With dead ends: 22033 [2025-01-09 14:48:18,563 INFO L226 Difference]: Without dead ends: 13555 [2025-01-09 14:48:18,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-01-09 14:48:18,591 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1241 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:18,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 867 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:48:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2025-01-09 14:48:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 8545. [2025-01-09 14:48:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8545 states, 7424 states have (on average 1.5387931034482758) internal successors, (11424), 7424 states have internal predecessors, (11424), 1056 states have call successors, (1056), 64 states have call predecessors, (1056), 64 states have return successors, (1056), 1056 states have call predecessors, (1056), 1056 states have call successors, (1056) [2025-01-09 14:48:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 13536 transitions. [2025-01-09 14:48:19,396 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 13536 transitions. Word has length 486 [2025-01-09 14:48:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 8545 states and 13536 transitions. [2025-01-09 14:48:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 13536 transitions. [2025-01-09 14:48:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:48:19,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:19,412 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:19,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:48:19,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 917792899, now seen corresponding path program 1 times [2025-01-09 14:48:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476505815] [2025-01-09 14:48:19,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:48:19,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:48:19,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476505815] [2025-01-09 14:48:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476505815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:20,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:20,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360275763] [2025-01-09 14:48:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:20,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:20,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:20,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:20,091 INFO L87 Difference]: Start difference. First operand 8545 states and 13536 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:20,776 INFO L93 Difference]: Finished difference Result 21359 states and 33854 transitions. [2025-01-09 14:48:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-01-09 14:48:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:20,823 INFO L225 Difference]: With dead ends: 21359 [2025-01-09 14:48:20,824 INFO L226 Difference]: Without dead ends: 12817 [2025-01-09 14:48:20,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:20,844 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 349 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:20,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 996 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12817 states. [2025-01-09 14:48:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12817 to 12815. [2025-01-09 14:48:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12815 states, 11134 states have (on average 1.5372732171726244) internal successors, (17116), 11134 states have internal predecessors, (17116), 1584 states have call successors, (1584), 96 states have call predecessors, (1584), 96 states have return successors, (1584), 1584 states have call predecessors, (1584), 1584 states have call successors, (1584) [2025-01-09 14:48:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12815 states to 12815 states and 20284 transitions. [2025-01-09 14:48:21,649 INFO L78 Accepts]: Start accepts. Automaton has 12815 states and 20284 transitions. Word has length 486 [2025-01-09 14:48:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:21,650 INFO L471 AbstractCegarLoop]: Abstraction has 12815 states and 20284 transitions. [2025-01-09 14:48:21,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 12815 states and 20284 transitions. [2025-01-09 14:48:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:48:21,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:21,666 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:21,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:48:21,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash -999960701, now seen corresponding path program 1 times [2025-01-09 14:48:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042817172] [2025-01-09 14:48:21,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:21,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:48:22,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:48:22,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:22,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042817172] [2025-01-09 14:48:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042817172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:48:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621185993] [2025-01-09 14:48:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:48:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:32,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:48:32,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:48:32,247 INFO L87 Difference]: Start difference. First operand 12815 states and 20284 transitions. Second operand has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:37,868 INFO L93 Difference]: Finished difference Result 82049 states and 133352 transitions. [2025-01-09 14:48:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:48:37,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-01-09 14:48:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:38,063 INFO L225 Difference]: With dead ends: 82049 [2025-01-09 14:48:38,064 INFO L226 Difference]: Without dead ends: 69237 [2025-01-09 14:48:38,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:48:38,097 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 4122 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4884 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:38,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 4884 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 14:48:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69237 states. [2025-01-09 14:48:40,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69237 to 30881. [2025-01-09 14:48:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30881 states, 27952 states have (on average 1.5825701202060676) internal successors, (44236), 27976 states have internal predecessors, (44236), 2760 states have call successors, (2760), 168 states have call predecessors, (2760), 168 states have return successors, (2760), 2736 states have call predecessors, (2760), 2760 states have call successors, (2760) [2025-01-09 14:48:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30881 states to 30881 states and 49756 transitions. [2025-01-09 14:48:40,229 INFO L78 Accepts]: Start accepts. Automaton has 30881 states and 49756 transitions. Word has length 486 [2025-01-09 14:48:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:40,230 INFO L471 AbstractCegarLoop]: Abstraction has 30881 states and 49756 transitions. [2025-01-09 14:48:40,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.25) internal successors, (159), 12 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30881 states and 49756 transitions. [2025-01-09 14:48:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:48:40,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:40,262 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:40,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:48:40,262 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:40,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash -556060027, now seen corresponding path program 1 times [2025-01-09 14:48:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:40,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801807435] [2025-01-09 14:48:40,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:40,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:48:40,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:48:40,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801807435] [2025-01-09 14:48:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801807435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:41,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:48:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416273905] [2025-01-09 14:48:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:41,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:48:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:41,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:48:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:48:41,891 INFO L87 Difference]: Start difference. First operand 30881 states and 49756 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:47,209 INFO L93 Difference]: Finished difference Result 120377 states and 194821 transitions. [2025-01-09 14:48:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:48:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 486 [2025-01-09 14:48:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:47,479 INFO L225 Difference]: With dead ends: 120377 [2025-01-09 14:48:47,479 INFO L226 Difference]: Without dead ends: 89499 [2025-01-09 14:48:47,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:48:47,539 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1907 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:47,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 2477 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:48:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89499 states. [2025-01-09 14:48:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89499 to 77960. [2025-01-09 14:48:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77960 states, 73694 states have (on average 1.616495237061362) internal successors, (119126), 73743 states have internal predecessors, (119126), 4011 states have call successors, (4011), 254 states have call predecessors, (4011), 254 states have return successors, (4011), 3962 states have call predecessors, (4011), 4011 states have call successors, (4011) [2025-01-09 14:48:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77960 states to 77960 states and 127148 transitions. [2025-01-09 14:48:50,862 INFO L78 Accepts]: Start accepts. Automaton has 77960 states and 127148 transitions. Word has length 486 [2025-01-09 14:48:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:50,863 INFO L471 AbstractCegarLoop]: Abstraction has 77960 states and 127148 transitions. [2025-01-09 14:48:50,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-01-09 14:48:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 77960 states and 127148 transitions. [2025-01-09 14:48:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-01-09 14:48:50,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:50,932 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:48:50,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:48:50,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:50,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1372212675, now seen corresponding path program 1 times [2025-01-09 14:48:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255393612] [2025-01-09 14:48:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:50,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-01-09 14:48:51,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-01-09 14:48:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:51,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-01-09 14:48:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255393612] [2025-01-09 14:48:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255393612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:52,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:48:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422455380] [2025-01-09 14:48:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:48:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:52,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:48:52,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:48:52,770 INFO L87 Difference]: Start difference. First operand 77960 states and 127148 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66)