./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 8b3b52d0771d28687db0ecd40f35ba0cd5ac6eaf2a4275309beef5f48092d06e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:57:20,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:57:20,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:57:20,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:57:20,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:57:20,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:57:20,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:57:20,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:57:20,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:57:20,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:57:20,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:57:20,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:57:20,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:57:20,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:57:20,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:57:20,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:57:20,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:57:20,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:57:20,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:57:20,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:57:20,799 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:57:20,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:57:20,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:57:20,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:57:20,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:57:20,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:57:20,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:57:20,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:57:20,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:57:20,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:57:20,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:57:20,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:57:20,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:57:20,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:57:20,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:57:20,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:57:20,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:57:20,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:57:20,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:57:20,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:57:20,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:57:20,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:57:20,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:57:20,836 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:57:20,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:57:20,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:57:20,837 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:57:20,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:57:20,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:57:20,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:57:20,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:57:20,838 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:57:20,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:57:20,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:57:20,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:57:20,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:57:20,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:57:20,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:57:20,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:57:20,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:57:20,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:57:20,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:57:20,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:57:20,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:57:20,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:57:20,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:57:20,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:57:20,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:57:20,842 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:57:20,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:57:20,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:57:20,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8b3b52d0771d28687db0ecd40f35ba0cd5ac6eaf2a4275309beef5f48092d06e [2022-07-11 23:57:21,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:57:21,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:57:21,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:57:21,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:57:21,054 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:57:21,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2022-07-11 23:57:21,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d24c42c/d0d5a64b37d54973ab4616c9620f1f82/FLAGc6af27d50 [2022-07-11 23:57:21,543 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:57:21,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label12.c [2022-07-11 23:57:21,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d24c42c/d0d5a64b37d54973ab4616c9620f1f82/FLAGc6af27d50 [2022-07-11 23:57:21,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d24c42c/d0d5a64b37d54973ab4616c9620f1f82 [2022-07-11 23:57:21,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:57:21,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:57:21,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:57:21,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:57:21,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:57:21,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:21,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132c1399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21, skipping insertion in model container [2022-07-11 23:57:21,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:21,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:57:21,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:57:21,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label12.c[20469,20482] [2022-07-11 23:57:21,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:57:21,914 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:57:21,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label12.c[20469,20482] [2022-07-11 23:57:21,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:57:21,998 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:57:21,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21 WrapperNode [2022-07-11 23:57:21,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:57:21,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:57:21,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:57:21,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:57:22,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,046 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-07-11 23:57:22,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:57:22,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:57:22,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:57:22,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:57:22,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:57:22,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:57:22,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:57:22,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:57:22,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (1/1) ... [2022-07-11 23:57:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:57:22,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:22,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:57:22,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:57:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:57:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:57:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:57:22,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:57:22,261 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:57:22,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:57:22,892 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:57:22,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:57:22,903 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:57:22,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:57:22 BoogieIcfgContainer [2022-07-11 23:57:22,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:57:22,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:57:22,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:57:22,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:57:22,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:57:21" (1/3) ... [2022-07-11 23:57:22,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f23293f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:57:22, skipping insertion in model container [2022-07-11 23:57:22,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:21" (2/3) ... [2022-07-11 23:57:22,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f23293f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:57:22, skipping insertion in model container [2022-07-11 23:57:22,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:57:22" (3/3) ... [2022-07-11 23:57:22,912 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label12.c [2022-07-11 23:57:22,921 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:57:22,922 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:57:22,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:57:22,974 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8fbaa18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48c68f58 [2022-07-11 23:57:22,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:57:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-11 23:57:22,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:22,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:22,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash -56899633, now seen corresponding path program 1 times [2022-07-11 23:57:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:23,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825724762] [2022-07-11 23:57:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:23,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:23,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825724762] [2022-07-11 23:57:23,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825724762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:23,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:23,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:57:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80357083] [2022-07-11 23:57:23,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:23,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:23,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:23,400 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:23,898 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-07-11 23:57:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:23,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-11 23:57:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:23,908 INFO L225 Difference]: With dead ends: 528 [2022-07-11 23:57:23,908 INFO L226 Difference]: Without dead ends: 266 [2022-07-11 23:57:23,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:23,913 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 52 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:23,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:57:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-11 23:57:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-11 23:57:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-07-11 23:57:23,948 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 120 [2022-07-11 23:57:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:23,949 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-07-11 23:57:23,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-07-11 23:57:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-11 23:57:23,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:23,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:23,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:57:23,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2046521246, now seen corresponding path program 1 times [2022-07-11 23:57:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506638545] [2022-07-11 23:57:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506638545] [2022-07-11 23:57:24,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506638545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:24,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:24,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:57:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810669433] [2022-07-11 23:57:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:24,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:24,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:24,020 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:24,298 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-07-11 23:57:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-07-11 23:57:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:24,302 INFO L225 Difference]: With dead ends: 792 [2022-07-11 23:57:24,302 INFO L226 Difference]: Without dead ends: 528 [2022-07-11 23:57:24,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:24,304 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:24,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:57:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-11 23:57:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-07-11 23:57:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2022-07-11 23:57:24,338 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 126 [2022-07-11 23:57:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:24,340 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2022-07-11 23:57:24,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2022-07-11 23:57:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-11 23:57:24,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:24,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:24,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:57:24,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1403860126, now seen corresponding path program 1 times [2022-07-11 23:57:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:24,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861878744] [2022-07-11 23:57:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:24,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861878744] [2022-07-11 23:57:24,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861878744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:24,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:24,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:24,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317158337] [2022-07-11 23:57:24,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:24,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:24,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:24,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:24,500 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:24,980 INFO L93 Difference]: Finished difference Result 1411 states and 1882 transitions. [2022-07-11 23:57:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-11 23:57:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:24,984 INFO L225 Difference]: With dead ends: 1411 [2022-07-11 23:57:24,985 INFO L226 Difference]: Without dead ends: 790 [2022-07-11 23:57:24,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:24,987 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:24,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 81 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:57:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-07-11 23:57:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2022-07-11 23:57:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.1634980988593155) internal successors, (918), 789 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 918 transitions. [2022-07-11 23:57:25,019 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 918 transitions. Word has length 127 [2022-07-11 23:57:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:25,019 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 918 transitions. [2022-07-11 23:57:25,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 918 transitions. [2022-07-11 23:57:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-11 23:57:25,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:25,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:57:25,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:25,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash 941886709, now seen corresponding path program 1 times [2022-07-11 23:57:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:25,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112661443] [2022-07-11 23:57:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:25,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:57:25,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:25,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112661443] [2022-07-11 23:57:25,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112661443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:25,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:25,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:57:25,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779118985] [2022-07-11 23:57:25,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:25,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:25,098 INFO L87 Difference]: Start difference. First operand 790 states and 918 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:25,345 INFO L93 Difference]: Finished difference Result 1578 states and 1859 transitions. [2022-07-11 23:57:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2022-07-11 23:57:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:25,348 INFO L225 Difference]: With dead ends: 1578 [2022-07-11 23:57:25,348 INFO L226 Difference]: Without dead ends: 921 [2022-07-11 23:57:25,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:25,350 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:25,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-07-11 23:57:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-07-11 23:57:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1532608695652173) internal successors, (1061), 920 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1061 transitions. [2022-07-11 23:57:25,365 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1061 transitions. Word has length 132 [2022-07-11 23:57:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:25,365 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1061 transitions. [2022-07-11 23:57:25,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1061 transitions. [2022-07-11 23:57:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-11 23:57:25,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:25,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:25,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:57:25,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1849923885, now seen corresponding path program 1 times [2022-07-11 23:57:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:25,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750496516] [2022-07-11 23:57:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:57:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:25,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750496516] [2022-07-11 23:57:25,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750496516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:25,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:25,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332101491] [2022-07-11 23:57:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:25,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:25,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:25,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:25,402 INFO L87 Difference]: Start difference. First operand 921 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:25,671 INFO L93 Difference]: Finished difference Result 2364 states and 2732 transitions. [2022-07-11 23:57:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-07-11 23:57:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:25,676 INFO L225 Difference]: With dead ends: 2364 [2022-07-11 23:57:25,676 INFO L226 Difference]: Without dead ends: 1576 [2022-07-11 23:57:25,677 INFO L412 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 [2022-07-11 23:57:25,677 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:25,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 19 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-07-11 23:57:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2022-07-11 23:57:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1505922165820643) internal successors, (1360), 1182 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1360 transitions. [2022-07-11 23:57:25,700 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1360 transitions. Word has length 141 [2022-07-11 23:57:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:25,700 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1360 transitions. [2022-07-11 23:57:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1360 transitions. [2022-07-11 23:57:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-11 23:57:25,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:25,703 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:25,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:57:25,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 744717572, now seen corresponding path program 1 times [2022-07-11 23:57:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35658933] [2022-07-11 23:57:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:57:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:25,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35658933] [2022-07-11 23:57:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35658933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:25,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63872767] [2022-07-11 23:57:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:25,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:25,749 INFO L87 Difference]: Start difference. First operand 1183 states and 1360 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:26,135 INFO L93 Difference]: Finished difference Result 2495 states and 2925 transitions. [2022-07-11 23:57:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-07-11 23:57:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:26,139 INFO L225 Difference]: With dead ends: 2495 [2022-07-11 23:57:26,139 INFO L226 Difference]: Without dead ends: 1445 [2022-07-11 23:57:26,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:26,141 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:26,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 34 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:57:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-07-11 23:57:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2022-07-11 23:57:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.144736842105263) internal successors, (1653), 1444 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1653 transitions. [2022-07-11 23:57:26,180 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1653 transitions. Word has length 147 [2022-07-11 23:57:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:26,180 INFO L495 AbstractCegarLoop]: Abstraction has 1445 states and 1653 transitions. [2022-07-11 23:57:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1653 transitions. [2022-07-11 23:57:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-11 23:57:26,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:26,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:57:26,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1477657121, now seen corresponding path program 1 times [2022-07-11 23:57:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:26,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184405926] [2022-07-11 23:57:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:57:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:26,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184405926] [2022-07-11 23:57:26,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184405926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:26,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:26,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585230747] [2022-07-11 23:57:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:26,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:26,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:26,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:26,247 INFO L87 Difference]: Start difference. First operand 1445 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:26,619 INFO L93 Difference]: Finished difference Result 3281 states and 3775 transitions. [2022-07-11 23:57:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-07-11 23:57:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:26,625 INFO L225 Difference]: With dead ends: 3281 [2022-07-11 23:57:26,625 INFO L226 Difference]: Without dead ends: 1969 [2022-07-11 23:57:26,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:26,627 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 371 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:26,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 42 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:57:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-07-11 23:57:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-07-11 23:57:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.136091453456723) internal successors, (2087), 1837 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2087 transitions. [2022-07-11 23:57:26,655 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2087 transitions. Word has length 161 [2022-07-11 23:57:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:26,655 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2087 transitions. [2022-07-11 23:57:26,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2087 transitions. [2022-07-11 23:57:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-11 23:57:26,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:26,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:26,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:57:26,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1161905244, now seen corresponding path program 1 times [2022-07-11 23:57:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:26,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279411274] [2022-07-11 23:57:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:57:26,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:26,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279411274] [2022-07-11 23:57:26,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279411274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:26,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:26,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987158436] [2022-07-11 23:57:26,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:26,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:26,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:26,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:26,762 INFO L87 Difference]: Start difference. First operand 1838 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:27,139 INFO L93 Difference]: Finished difference Result 3805 states and 4312 transitions. [2022-07-11 23:57:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2022-07-11 23:57:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:27,145 INFO L225 Difference]: With dead ends: 3805 [2022-07-11 23:57:27,145 INFO L226 Difference]: Without dead ends: 2100 [2022-07-11 23:57:27,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:27,147 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 275 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:27,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 33 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:57:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-07-11 23:57:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2022-07-11 23:57:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1295590636908002) internal successors, (2075), 1837 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2075 transitions. [2022-07-11 23:57:27,179 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2075 transitions. Word has length 178 [2022-07-11 23:57:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:27,180 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2075 transitions. [2022-07-11 23:57:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2075 transitions. [2022-07-11 23:57:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-11 23:57:27,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:27,184 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:27,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:57:27,186 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1227793732, now seen corresponding path program 1 times [2022-07-11 23:57:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785005132] [2022-07-11 23:57:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:57:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:27,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785005132] [2022-07-11 23:57:27,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785005132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:27,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:27,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:57:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905633778] [2022-07-11 23:57:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:27,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:57:27,279 INFO L87 Difference]: Start difference. First operand 1838 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:27,530 INFO L93 Difference]: Finished difference Result 3936 states and 4452 transitions. [2022-07-11 23:57:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:27,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2022-07-11 23:57:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:27,536 INFO L225 Difference]: With dead ends: 3936 [2022-07-11 23:57:27,536 INFO L226 Difference]: Without dead ends: 2231 [2022-07-11 23:57:27,538 INFO L412 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 [2022-07-11 23:57:27,539 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:27,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 180 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-07-11 23:57:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2022-07-11 23:57:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.120057170080991) internal successors, (2351), 2099 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2351 transitions. [2022-07-11 23:57:27,568 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2351 transitions. Word has length 221 [2022-07-11 23:57:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:27,568 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 2351 transitions. [2022-07-11 23:57:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2351 transitions. [2022-07-11 23:57:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-11 23:57:27,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:27,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:27,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:57:27,572 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:27,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1353294225, now seen corresponding path program 1 times [2022-07-11 23:57:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534475631] [2022-07-11 23:57:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:27,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:27,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534475631] [2022-07-11 23:57:27,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534475631] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:57:27,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740714643] [2022-07-11 23:57:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:27,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:27,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:57:27,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:57:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:27,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:57:27,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-11 23:57:28,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:28,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740714643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:28,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:57:28,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-07-11 23:57:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23767917] [2022-07-11 23:57:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:28,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:28,124 INFO L87 Difference]: Start difference. First operand 2100 states and 2351 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:28,380 INFO L93 Difference]: Finished difference Result 3281 states and 3634 transitions. [2022-07-11 23:57:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2022-07-11 23:57:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:28,388 INFO L225 Difference]: With dead ends: 3281 [2022-07-11 23:57:28,388 INFO L226 Difference]: Without dead ends: 3279 [2022-07-11 23:57:28,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:28,390 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:28,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 31 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-07-11 23:57:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 2886. [2022-07-11 23:57:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2885 states have (on average 1.1109185441941074) internal successors, (3205), 2885 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 3205 transitions. [2022-07-11 23:57:28,431 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 3205 transitions. Word has length 224 [2022-07-11 23:57:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:28,432 INFO L495 AbstractCegarLoop]: Abstraction has 2886 states and 3205 transitions. [2022-07-11 23:57:28,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3205 transitions. [2022-07-11 23:57:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-11 23:57:28,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:28,436 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:28,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:28,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:57:28,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 650780722, now seen corresponding path program 1 times [2022-07-11 23:57:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:28,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046110581] [2022-07-11 23:57:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 23:57:28,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:28,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046110581] [2022-07-11 23:57:28,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046110581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:57:28,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254723647] [2022-07-11 23:57:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:28,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:57:28,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:57:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:28,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:57:28,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:57:29,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254723647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:29,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:57:29,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-11 23:57:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732984610] [2022-07-11 23:57:29,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:29,028 INFO L87 Difference]: Start difference. First operand 2886 states and 3205 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:29,286 INFO L93 Difference]: Finished difference Result 5770 states and 6408 transitions. [2022-07-11 23:57:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:29,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2022-07-11 23:57:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:29,293 INFO L225 Difference]: With dead ends: 5770 [2022-07-11 23:57:29,294 INFO L226 Difference]: Without dead ends: 2886 [2022-07-11 23:57:29,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:29,297 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:29,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 170 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2022-07-11 23:57:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1838. [2022-07-11 23:57:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.105606967882417) internal successors, (2031), 1837 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2031 transitions. [2022-07-11 23:57:29,338 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2031 transitions. Word has length 237 [2022-07-11 23:57:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:29,338 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2031 transitions. [2022-07-11 23:57:29,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2031 transitions. [2022-07-11 23:57:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-07-11 23:57:29,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:29,342 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:29,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:29,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-11 23:57:29,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1857855304, now seen corresponding path program 1 times [2022-07-11 23:57:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331920962] [2022-07-11 23:57:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 23:57:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331920962] [2022-07-11 23:57:29,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331920962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:57:29,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61757798] [2022-07-11 23:57:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:29,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:57:29,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:57:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:57:29,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-11 23:57:29,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61757798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:29,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:57:29,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:57:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095055733] [2022-07-11 23:57:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:29,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:29,875 INFO L87 Difference]: Start difference. First operand 1838 states and 2031 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:30,148 INFO L93 Difference]: Finished difference Result 4067 states and 4481 transitions. [2022-07-11 23:57:30,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:30,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2022-07-11 23:57:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:30,153 INFO L225 Difference]: With dead ends: 4067 [2022-07-11 23:57:30,153 INFO L226 Difference]: Without dead ends: 1838 [2022-07-11 23:57:30,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:30,156 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:30,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 173 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:57:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-11 23:57:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2022-07-11 23:57:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.0720984759671748) internal successors, (1829), 1706 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1829 transitions. [2022-07-11 23:57:30,182 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1829 transitions. Word has length 246 [2022-07-11 23:57:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:30,183 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 1829 transitions. [2022-07-11 23:57:30,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:30,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1829 transitions. [2022-07-11 23:57:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-07-11 23:57:30,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:30,191 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:30,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:30,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:30,392 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:30,392 INFO L85 PathProgramCache]: Analyzing trace with hash -527293898, now seen corresponding path program 1 times [2022-07-11 23:57:30,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:57:30,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257249739] [2022-07-11 23:57:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:30,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:57:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-11 23:57:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:57:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257249739] [2022-07-11 23:57:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257249739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:57:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393114461] [2022-07-11 23:57:30,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:30,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:57:30,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:57:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:30,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:57:30,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-11 23:57:30,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:30,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393114461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:30,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:57:30,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-11 23:57:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144730957] [2022-07-11 23:57:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:30,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:57:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:57:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:57:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:57:30,759 INFO L87 Difference]: Start difference. First operand 1707 states and 1829 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:31,016 INFO L93 Difference]: Finished difference Result 3541 states and 3807 transitions. [2022-07-11 23:57:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:57:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2022-07-11 23:57:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:31,017 INFO L225 Difference]: With dead ends: 3541 [2022-07-11 23:57:31,017 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:57:31,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:57:31,020 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:31,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:57:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:57:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:57:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:57:31,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2022-07-11 23:57:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:31,021 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:57:31,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:57:31,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:57:31,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:57:31,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:31,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:57:31,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:57:31,833 INFO L899 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-07-11 23:57:31,834 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-07-11 23:57:31,835 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-07-11 23:57:31,836 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-07-11 23:57:31,837 INFO L899 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-07-11 23:57:31,838 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-07-11 23:57:31,839 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-07-11 23:57:31,840 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-07-11 23:57:31,841 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,842 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-07-11 23:57:31,843 INFO L899 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-07-11 23:57:31,844 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-07-11 23:57:31,845 INFO L899 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-07-11 23:57:31,846 INFO L895 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse1 (= ~a16~0 6)) (.cse2 (<= ~a17~0 0)) (.cse8 (= ~a20~0 1)) (.cse3 (= ~a21~0 1)) (.cse4 (<= 15 ~a8~0)) (.cse0 (<= ~a20~0 0)) (.cse7 (<= ~a8~0 13)) (.cse5 (= ~a17~0 1)) (.cse6 (<= ~a16~0 5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse5 .cse4) (and .cse0 .cse2 .cse3 .cse6) (and .cse7 .cse8) (and (<= ~a7~0 0) (= ~a12~0 8) .cse3 .cse5 .cse8) (and .cse2 .cse3 .cse6 .cse8) (and .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse7 .cse3 .cse6) (and .cse0 .cse3 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse5 .cse6))) [2022-07-11 23:57:31,846 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-07-11 23:57:31,847 INFO L899 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-07-11 23:57:31,848 INFO L902 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-07-11 23:57:31,849 INFO L899 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,850 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-07-11 23:57:31,851 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse1 (= ~a16~0 6)) (.cse2 (<= ~a17~0 0)) (.cse8 (= ~a20~0 1)) (.cse3 (= ~a21~0 1)) (.cse4 (<= 15 ~a8~0)) (.cse0 (<= ~a20~0 0)) (.cse7 (<= ~a8~0 13)) (.cse5 (= ~a17~0 1)) (.cse6 (<= ~a16~0 5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse5 .cse4) (and .cse0 .cse2 .cse3 .cse6) (and .cse7 .cse8) (and (<= ~a7~0 0) (= ~a12~0 8) .cse3 .cse5 .cse8) (and .cse2 .cse3 .cse6 .cse8) (and .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse7 .cse3 .cse6) (and .cse0 .cse3 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse5 .cse6))) [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,852 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 546) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-07-11 23:57:31,853 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:57:31,854 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-07-11 23:57:31,855 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-07-11 23:57:31,855 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-07-11 23:57:31,855 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-07-11 23:57:31,858 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:31,859 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:57:31,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:57:31 BoogieIcfgContainer [2022-07-11 23:57:31,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:57:31,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:57:31,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:57:31,872 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:57:31,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:57:22" (3/4) ... [2022-07-11 23:57:31,874 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:57:31,885 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:57:31,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:57:31,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:57:31,887 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:57:31,966 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:57:31,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:57:31,967 INFO L158 Benchmark]: Toolchain (without parser) took 10396.64ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 75.6MB in the beginning and 154.1MB in the end (delta: -78.6MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,967 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:57:31,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.96ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 68.0MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.51ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,968 INFO L158 Benchmark]: Boogie Preprocessor took 48.26ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,968 INFO L158 Benchmark]: RCFGBuilder took 809.08ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 58.0MB in the beginning and 74.3MB in the end (delta: -16.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,969 INFO L158 Benchmark]: TraceAbstraction took 8965.02ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 73.5MB in the beginning and 164.6MB in the end (delta: -91.2MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,969 INFO L158 Benchmark]: Witness Printer took 94.83ms. Allocated memory is still 234.9MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:57:31,970 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.96ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 68.0MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.51ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 62.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.26ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 809.08ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 58.0MB in the beginning and 74.3MB in the end (delta: -16.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8965.02ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 73.5MB in the beginning and 164.6MB in the end (delta: -91.2MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. * Witness Printer took 94.83ms. Allocated memory is still 234.9MB. Free memory was 164.6MB in the beginning and 154.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 546]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1749 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1749 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4847 IncrementalHoareTripleChecker+Invalid, 5569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 722 mSolverCounterUnsat, 1006 mSDtfsCounter, 4847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1010 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2886occurred in iteration=10, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2489 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 41 NumberOfFragments, 275 HoareAnnotationTreeSize, 3 FomulaSimplifications, 322 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2822 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3297 NumberOfCodeBlocks, 3297 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3280 ConstructedInterpolants, 0 QuantifiedInterpolants, 16306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1760 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1743/2142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((a20 <= 0 && a16 == 6) && a17 <= 0) && a21 == 1) && 15 <= a8) || ((((a20 <= 0 && a16 == 6) && a21 == 1) && a17 == 1) && 15 <= a8)) || (((a20 <= 0 && a17 <= 0) && a21 == 1) && a16 <= 5)) || (a8 <= 13 && a20 == 1)) || ((((a7 <= 0 && a12 == 8) && a21 == 1) && a17 == 1) && a20 == 1)) || (((a17 <= 0 && a21 == 1) && a16 <= 5) && a20 == 1)) || (((a17 <= 0 && a21 == 1) && a20 == 1) && 15 <= a8)) || (((a20 <= 0 && a8 <= 13) && a21 == 1) && a16 <= 5)) || ((((a20 <= 0 && a21 == 1) && a17 == 1) && a16 <= 5) && 15 <= a8)) || (((a20 <= 0 && a8 <= 13) && a17 == 1) && a16 <= 5) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((a20 <= 0 && a16 == 6) && a17 <= 0) && a21 == 1) && 15 <= a8) || ((((a20 <= 0 && a16 == 6) && a21 == 1) && a17 == 1) && 15 <= a8)) || (((a20 <= 0 && a17 <= 0) && a21 == 1) && a16 <= 5)) || (a8 <= 13 && a20 == 1)) || ((((a7 <= 0 && a12 == 8) && a21 == 1) && a17 == 1) && a20 == 1)) || (((a17 <= 0 && a21 == 1) && a16 <= 5) && a20 == 1)) || (((a17 <= 0 && a21 == 1) && a20 == 1) && 15 <= a8)) || (((a20 <= 0 && a8 <= 13) && a21 == 1) && a16 <= 5)) || ((((a20 <= 0 && a21 == 1) && a17 == 1) && a16 <= 5) && 15 <= a8)) || (((a20 <= 0 && a8 <= 13) && a17 == 1) && a16 <= 5) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:57:31,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE