./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label31.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/Problem15_label31.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 c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 01:20:42,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 01:20:42,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 01:20:42,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 01:20:42,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 01:20:42,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 01:20:42,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 01:20:42,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 01:20:42,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 01:20:42,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 01:20:42,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 01:20:42,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 01:20:42,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 01:20:42,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 01:20:42,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 01:20:42,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 01:20:42,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 01:20:42,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 01:20:42,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 01:20:42,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 01:20:42,519 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 01:20:42,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 01:20:42,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 01:20:42,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 01:20:42,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 01:20:42,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 01:20:42,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 01:20:42,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 01:20:42,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 01:20:42,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 01:20:42,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 01:20:42,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 01:20:42,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 01:20:42,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 01:20:42,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 01:20:42,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 01:20:42,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 01:20:42,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 01:20:42,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 01:20:42,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 01:20:42,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 01:20:42,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 01:20:42,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 01:20:42,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 01:20:42,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 01:20:42,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 01:20:42,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 01:20:42,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 01:20:42,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 01:20:42,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 01:20:42,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 01:20:42,587 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 01:20:42,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 01:20:42,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 01:20:42,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 01:20:42,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 01:20:42,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 01:20:42,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 01:20:42,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 01:20:42,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 01:20:42,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 01:20:42,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 01:20:42,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:20:42,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 01:20:42,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 01:20:42,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 01:20:42,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 01:20:42,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 01:20:42,598 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 01:20:42,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 01:20:42,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 01:20:42,598 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 -> c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba [2022-07-12 01:20:42,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 01:20:42,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 01:20:42,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 01:20:42,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 01:20:42,881 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 01:20:42,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2022-07-12 01:20:42,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cacc6f01/62734997d6ec4056afcf1a4d08e5c636/FLAG7f3305e13 [2022-07-12 01:20:43,564 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 01:20:43,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2022-07-12 01:20:43,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cacc6f01/62734997d6ec4056afcf1a4d08e5c636/FLAG7f3305e13 [2022-07-12 01:20:43,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cacc6f01/62734997d6ec4056afcf1a4d08e5c636 [2022-07-12 01:20:43,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 01:20:43,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 01:20:43,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 01:20:43,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 01:20:43,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 01:20:43,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:20:43" (1/1) ... [2022-07-12 01:20:43,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d54e951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:43, skipping insertion in model container [2022-07-12 01:20:43,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:20:43" (1/1) ... [2022-07-12 01:20:43,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 01:20:43,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 01:20:44,072 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/Problem15_label31.c[7892,7905] [2022-07-12 01:20:44,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:20:44,463 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 01:20:44,491 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/Problem15_label31.c[7892,7905] [2022-07-12 01:20:44,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:20:44,669 INFO L208 MainTranslator]: Completed translation [2022-07-12 01:20:44,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44 WrapperNode [2022-07-12 01:20:44,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 01:20:44,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 01:20:44,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 01:20:44,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 01:20:44,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:44,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:44,902 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-07-12 01:20:44,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 01:20:44,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 01:20:44,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 01:20:44,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 01:20:44,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:44,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:44,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:44,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:45,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:45,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:45,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:45,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 01:20:45,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 01:20:45,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 01:20:45,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 01:20:45,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (1/1) ... [2022-07-12 01:20:45,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:20:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:20:45,197 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-12 01:20:45,201 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-12 01:20:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 01:20:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 01:20:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 01:20:45,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 01:20:45,329 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 01:20:45,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 01:20:47,789 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 01:20:47,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 01:20:47,806 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 01:20:47,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:20:47 BoogieIcfgContainer [2022-07-12 01:20:47,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 01:20:47,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 01:20:47,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 01:20:47,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 01:20:47,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:20:43" (1/3) ... [2022-07-12 01:20:47,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb2ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:20:47, skipping insertion in model container [2022-07-12 01:20:47,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:20:44" (2/3) ... [2022-07-12 01:20:47,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb2ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:20:47, skipping insertion in model container [2022-07-12 01:20:47,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:20:47" (3/3) ... [2022-07-12 01:20:47,815 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label31.c [2022-07-12 01:20:47,827 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 01:20:47,828 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 01:20:47,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 01:20:47,906 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@6724d98f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d0c77f5 [2022-07-12 01:20:47,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 01:20:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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-12 01:20:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 01:20:47,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:47,931 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] [2022-07-12 01:20:47,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times [2022-07-12 01:20:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:47,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33518281] [2022-07-12 01:20:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:48,285 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-12 01:20:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33518281] [2022-07-12 01:20:48,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33518281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:48,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:48,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:20:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051105376] [2022-07-12 01:20:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:48,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:20:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:20:48,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:20:48,328 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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-12 01:20:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:20:50,541 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions. [2022-07-12 01:20:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:20:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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 65 [2022-07-12 01:20:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:20:50,558 INFO L225 Difference]: With dead ends: 1197 [2022-07-12 01:20:50,558 INFO L226 Difference]: Without dead ends: 694 [2022-07-12 01:20:50,563 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-12 01:20:50,566 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 353 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:20:50,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 01:20:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-12 01:20:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2022-07-12 01:20:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 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-12 01:20:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2022-07-12 01:20:50,648 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 65 [2022-07-12 01:20:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:20:50,648 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2022-07-12 01:20:50,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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-12 01:20:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2022-07-12 01:20:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 01:20:50,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:50,653 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:20:50,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 01:20:50,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash -597315905, now seen corresponding path program 1 times [2022-07-12 01:20:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345531462] [2022-07-12 01:20:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:20:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345531462] [2022-07-12 01:20:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345531462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:50,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:50,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:20:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568662600] [2022-07-12 01:20:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:50,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:20:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:20:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:20:50,787 INFO L87 Difference]: Start difference. First operand 684 states and 1174 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-12 01:20:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:20:52,563 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2022-07-12 01:20:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:20:52,564 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 130 [2022-07-12 01:20:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:20:52,568 INFO L225 Difference]: With dead ends: 1681 [2022-07-12 01:20:52,568 INFO L226 Difference]: Without dead ends: 999 [2022-07-12 01:20:52,570 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-12 01:20:52,571 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:20:52,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:20:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-12 01:20:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2022-07-12 01:20:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 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-12 01:20:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2022-07-12 01:20:52,613 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 130 [2022-07-12 01:20:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:20:52,617 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2022-07-12 01:20:52,618 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-12 01:20:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2022-07-12 01:20:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 01:20:52,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:52,626 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:20:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 01:20:52,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 729994212, now seen corresponding path program 1 times [2022-07-12 01:20:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:52,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282413124] [2022-07-12 01:20:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:20:52,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:52,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282413124] [2022-07-12 01:20:52,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282413124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:52,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:52,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:20:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517996453] [2022-07-12 01:20:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:52,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:20:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:20:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:20:52,772 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-12 01:20:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:20:54,185 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions. [2022-07-12 01:20:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:20:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2022-07-12 01:20:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:20:54,193 INFO L225 Difference]: With dead ends: 2575 [2022-07-12 01:20:54,193 INFO L226 Difference]: Without dead ends: 1588 [2022-07-12 01:20:54,197 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-12 01:20:54,203 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:20:54,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:20:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-07-12 01:20:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2022-07-12 01:20:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.3986102337334176) internal successors, (2214), 1583 states have internal predecessors, (2214), 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-12 01:20:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions. [2022-07-12 01:20:54,244 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 131 [2022-07-12 01:20:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:20:54,246 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions. [2022-07-12 01:20:54,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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-12 01:20:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions. [2022-07-12 01:20:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 01:20:54,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:54,249 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 01:20:54,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 01:20:54,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 292340142, now seen corresponding path program 1 times [2022-07-12 01:20:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:54,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094414553] [2022-07-12 01:20:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:20:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:54,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094414553] [2022-07-12 01:20:54,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094414553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:54,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:54,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:20:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623062148] [2022-07-12 01:20:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:54,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:20:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:20:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:20:54,415 INFO L87 Difference]: Start difference. First operand 1584 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-12 01:20:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:20:56,530 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions. [2022-07-12 01:20:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:20:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 135 [2022-07-12 01:20:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:20:56,540 INFO L225 Difference]: With dead ends: 4090 [2022-07-12 01:20:56,541 INFO L226 Difference]: Without dead ends: 2807 [2022-07-12 01:20:56,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:20:56,544 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 349 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:20:56,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 416 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 01:20:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-12 01:20:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184. [2022-07-12 01:20:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.3302794319743472) internal successors, (2904), 2183 states have internal predecessors, (2904), 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-12 01:20:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions. [2022-07-12 01:20:56,595 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 135 [2022-07-12 01:20:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:20:56,597 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions. [2022-07-12 01:20:56,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-12 01:20:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions. [2022-07-12 01:20:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2022-07-12 01:20:56,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:56,602 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:20:56,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 01:20:56,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1279382026, now seen corresponding path program 1 times [2022-07-12 01:20:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658928965] [2022-07-12 01:20:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 01:20:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:56,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658928965] [2022-07-12 01:20:56,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658928965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:56,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:56,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:20:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144569119] [2022-07-12 01:20:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:20:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:20:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:20:56,895 INFO L87 Difference]: Start difference. First operand 2184 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-12 01:20:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:20:58,615 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions. [2022-07-12 01:20:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:20:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 335 [2022-07-12 01:20:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:20:58,630 INFO L225 Difference]: With dead ends: 5868 [2022-07-12 01:20:58,630 INFO L226 Difference]: Without dead ends: 3686 [2022-07-12 01:20:58,634 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-12 01:20:58,635 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:20:58,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:20:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-07-12 01:20:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2022-07-12 01:20:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3683 states have (on average 1.25821341297855) internal successors, (4634), 3683 states have internal predecessors, (4634), 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-12 01:20:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2022-07-12 01:20:58,705 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 335 [2022-07-12 01:20:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:20:58,707 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2022-07-12 01:20:58,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-12 01:20:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2022-07-12 01:20:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2022-07-12 01:20:58,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:20:58,717 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 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] [2022-07-12 01:20:58,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 01:20:58,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:20:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:20:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1245441651, now seen corresponding path program 1 times [2022-07-12 01:20:58,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:20:58,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173631304] [2022-07-12 01:20:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:20:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:20:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:20:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-12 01:20:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:20:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173631304] [2022-07-12 01:20:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173631304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:20:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:20:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:20:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375742517] [2022-07-12 01:20:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:20:58,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:20:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:20:58,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:20:58,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:20:58,901 INFO L87 Difference]: Start difference. First operand 3684 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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-12 01:21:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:00,387 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2022-07-12 01:21:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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 383 [2022-07-12 01:21:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:00,405 INFO L225 Difference]: With dead ends: 7665 [2022-07-12 01:21:00,405 INFO L226 Difference]: Without dead ends: 3983 [2022-07-12 01:21:00,411 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-12 01:21:00,412 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:00,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:21:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2022-07-12 01:21:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2022-07-12 01:21:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3982 states have (on average 1.2403314917127073) internal successors, (4939), 3982 states have internal predecessors, (4939), 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-12 01:21:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2022-07-12 01:21:00,477 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 383 [2022-07-12 01:21:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:00,478 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2022-07-12 01:21:00,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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-12 01:21:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2022-07-12 01:21:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2022-07-12 01:21:00,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:00,486 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:00,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 01:21:00,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 342717355, now seen corresponding path program 1 times [2022-07-12 01:21:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:00,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773205673] [2022-07-12 01:21:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 01:21:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:00,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773205673] [2022-07-12 01:21:00,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773205673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:00,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815949453] [2022-07-12 01:21:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:00,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:00,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:00,684 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-12 01:21:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:02,255 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2022-07-12 01:21:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:02,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 426 [2022-07-12 01:21:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:02,276 INFO L225 Difference]: With dead ends: 8861 [2022-07-12 01:21:02,276 INFO L226 Difference]: Without dead ends: 5179 [2022-07-12 01:21:02,281 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-12 01:21:02,284 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 249 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:02,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:21:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2022-07-12 01:21:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2022-07-12 01:21:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.26301775147929) internal successors, (4269), 3380 states have internal predecessors, (4269), 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-12 01:21:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2022-07-12 01:21:02,345 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 426 [2022-07-12 01:21:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:02,346 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2022-07-12 01:21:02,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-12 01:21:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2022-07-12 01:21:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2022-07-12 01:21:02,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:02,354 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 01:21:02,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1686545730, now seen corresponding path program 1 times [2022-07-12 01:21:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:02,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940737132] [2022-07-12 01:21:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:21:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940737132] [2022-07-12 01:21:02,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940737132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:02,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:02,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 01:21:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509393801] [2022-07-12 01:21:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:21:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:21:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:21:02,641 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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-12 01:21:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:04,405 INFO L93 Difference]: Finished difference Result 8297 states and 10744 transitions. [2022-07-12 01:21:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 01:21:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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 430 [2022-07-12 01:21:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:04,432 INFO L225 Difference]: With dead ends: 8297 [2022-07-12 01:21:04,432 INFO L226 Difference]: Without dead ends: 5217 [2022-07-12 01:21:04,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:04,438 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 387 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 379 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:21:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-07-12 01:21:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4878. [2022-07-12 01:21:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4877 states have (on average 1.2259585810949354) internal successors, (5979), 4877 states have internal predecessors, (5979), 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-12 01:21:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 5979 transitions. [2022-07-12 01:21:04,538 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 5979 transitions. Word has length 430 [2022-07-12 01:21:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:04,539 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 5979 transitions. [2022-07-12 01:21:04,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 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-12 01:21:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 5979 transitions. [2022-07-12 01:21:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2022-07-12 01:21:04,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:04,544 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:04,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 01:21:04,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1041714720, now seen corresponding path program 1 times [2022-07-12 01:21:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:04,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072940850] [2022-07-12 01:21:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 01:21:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:04,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072940850] [2022-07-12 01:21:04,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072940850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:04,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:04,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835577845] [2022-07-12 01:21:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:04,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:04,795 INFO L87 Difference]: Start difference. First operand 4878 states and 5979 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-12 01:21:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:06,051 INFO L93 Difference]: Finished difference Result 10952 states and 13771 transitions. [2022-07-12 01:21:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:06,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 442 [2022-07-12 01:21:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:06,069 INFO L225 Difference]: With dead ends: 10952 [2022-07-12 01:21:06,070 INFO L226 Difference]: Without dead ends: 6375 [2022-07-12 01:21:06,075 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-12 01:21:06,075 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:06,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 619 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 01:21:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2022-07-12 01:21:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6374. [2022-07-12 01:21:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6374 states, 6373 states have (on average 1.198022909147968) internal successors, (7635), 6373 states have internal predecessors, (7635), 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-12 01:21:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7635 transitions. [2022-07-12 01:21:06,171 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7635 transitions. Word has length 442 [2022-07-12 01:21:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:06,172 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7635 transitions. [2022-07-12 01:21:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-12 01:21:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7635 transitions. [2022-07-12 01:21:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2022-07-12 01:21:06,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:06,179 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 01:21:06,180 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -255819651, now seen corresponding path program 1 times [2022-07-12 01:21:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:06,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222301556] [2022-07-12 01:21:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-12 01:21:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:06,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222301556] [2022-07-12 01:21:06,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222301556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:06,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:06,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414048542] [2022-07-12 01:21:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:06,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:06,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:06,412 INFO L87 Difference]: Start difference. First operand 6374 states and 7635 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-12 01:21:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:08,119 INFO L93 Difference]: Finished difference Result 16633 states and 20159 transitions. [2022-07-12 01:21:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 539 [2022-07-12 01:21:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:08,138 INFO L225 Difference]: With dead ends: 16633 [2022-07-12 01:21:08,138 INFO L226 Difference]: Without dead ends: 10560 [2022-07-12 01:21:08,146 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-12 01:21:08,147 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 275 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:08,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 263 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 01:21:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-12 01:21:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467. [2022-07-12 01:21:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8467 states, 8466 states have (on average 1.1961965509095205) internal successors, (10127), 8466 states have internal predecessors, (10127), 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-12 01:21:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10127 transitions. [2022-07-12 01:21:08,283 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10127 transitions. Word has length 539 [2022-07-12 01:21:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:08,284 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 10127 transitions. [2022-07-12 01:21:08,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-12 01:21:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10127 transitions. [2022-07-12 01:21:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-12 01:21:08,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:08,292 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 01:21:08,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1309397632, now seen corresponding path program 1 times [2022-07-12 01:21:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:08,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198656216] [2022-07-12 01:21:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-12 01:21:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198656216] [2022-07-12 01:21:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198656216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:08,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696857911] [2022-07-12 01:21:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:08,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:08,515 INFO L87 Difference]: Start difference. First operand 8467 states and 10127 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 01:21:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:10,113 INFO L93 Difference]: Finished difference Result 19937 states and 23976 transitions. [2022-07-12 01:21:10,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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 556 [2022-07-12 01:21:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:10,133 INFO L225 Difference]: With dead ends: 19937 [2022-07-12 01:21:10,133 INFO L226 Difference]: Without dead ends: 11771 [2022-07-12 01:21:10,141 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-12 01:21:10,142 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 243 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:10,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 621 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:21:10,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2022-07-12 01:21:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11759. [2022-07-12 01:21:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11759 states, 11758 states have (on average 1.173924136757952) internal successors, (13803), 11758 states have internal predecessors, (13803), 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-12 01:21:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 13803 transitions. [2022-07-12 01:21:10,284 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 13803 transitions. Word has length 556 [2022-07-12 01:21:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:10,285 INFO L495 AbstractCegarLoop]: Abstraction has 11759 states and 13803 transitions. [2022-07-12 01:21:10,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-12 01:21:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 13803 transitions. [2022-07-12 01:21:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2022-07-12 01:21:10,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:10,294 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:10,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 01:21:10,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -951322089, now seen corresponding path program 1 times [2022-07-12 01:21:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:10,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549257165] [2022-07-12 01:21:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 01:21:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:10,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549257165] [2022-07-12 01:21:10,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549257165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:10,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:10,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874695400] [2022-07-12 01:21:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:10,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:10,513 INFO L87 Difference]: Start difference. First operand 11759 states and 13803 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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-12 01:21:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:11,787 INFO L93 Difference]: Finished difference Result 23514 states and 27644 transitions. [2022-07-12 01:21:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 566 [2022-07-12 01:21:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:11,808 INFO L225 Difference]: With dead ends: 23514 [2022-07-12 01:21:11,809 INFO L226 Difference]: Without dead ends: 12056 [2022-07-12 01:21:11,818 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-12 01:21:11,819 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:11,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 01:21:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2022-07-12 01:21:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11757. [2022-07-12 01:21:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11756 states have (on average 1.1737835998638992) internal successors, (13799), 11756 states have internal predecessors, (13799), 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-12 01:21:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13799 transitions. [2022-07-12 01:21:11,958 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13799 transitions. Word has length 566 [2022-07-12 01:21:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:11,959 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 13799 transitions. [2022-07-12 01:21:11,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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-12 01:21:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13799 transitions. [2022-07-12 01:21:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2022-07-12 01:21:11,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:11,971 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:11,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 01:21:11,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1512951466, now seen corresponding path program 1 times [2022-07-12 01:21:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903256445] [2022-07-12 01:21:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-12 01:21:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:12,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903256445] [2022-07-12 01:21:12,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903256445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:12,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:12,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:12,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629367430] [2022-07-12 01:21:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:12,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:12,183 INFO L87 Difference]: Start difference. First operand 11757 states and 13799 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-12 01:21:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:13,261 INFO L93 Difference]: Finished difference Result 24708 states and 28972 transitions. [2022-07-12 01:21:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 586 [2022-07-12 01:21:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:13,285 INFO L225 Difference]: With dead ends: 24708 [2022-07-12 01:21:13,286 INFO L226 Difference]: Without dead ends: 13252 [2022-07-12 01:21:13,298 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-12 01:21:13,302 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 270 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:13,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 324 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 01:21:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2022-07-12 01:21:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 9960. [2022-07-12 01:21:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9960 states, 9959 states have (on average 1.1905813836730594) internal successors, (11857), 9959 states have internal predecessors, (11857), 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-12 01:21:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 11857 transitions. [2022-07-12 01:21:13,451 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 11857 transitions. Word has length 586 [2022-07-12 01:21:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:13,452 INFO L495 AbstractCegarLoop]: Abstraction has 9960 states and 11857 transitions. [2022-07-12 01:21:13,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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-12 01:21:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 11857 transitions. [2022-07-12 01:21:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2022-07-12 01:21:13,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:13,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:13,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 01:21:13,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 241840910, now seen corresponding path program 1 times [2022-07-12 01:21:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:13,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303209987] [2022-07-12 01:21:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 01:21:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:13,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303209987] [2022-07-12 01:21:13,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303209987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:13,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:13,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499180801] [2022-07-12 01:21:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:13,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:13,707 INFO L87 Difference]: Start difference. First operand 9960 states and 11857 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-12 01:21:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:15,244 INFO L93 Difference]: Finished difference Result 25898 states and 30912 transitions. [2022-07-12 01:21:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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 592 [2022-07-12 01:21:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:15,273 INFO L225 Difference]: With dead ends: 25898 [2022-07-12 01:21:15,273 INFO L226 Difference]: Without dead ends: 16239 [2022-07-12 01:21:15,286 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-12 01:21:15,286 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 225 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:15,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 187 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:21:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16239 states. [2022-07-12 01:21:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16239 to 12053. [2022-07-12 01:21:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12053 states, 12052 states have (on average 1.2118320610687023) internal successors, (14605), 12052 states have internal predecessors, (14605), 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-12 01:21:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12053 states to 12053 states and 14605 transitions. [2022-07-12 01:21:15,448 INFO L78 Accepts]: Start accepts. Automaton has 12053 states and 14605 transitions. Word has length 592 [2022-07-12 01:21:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:15,448 INFO L495 AbstractCegarLoop]: Abstraction has 12053 states and 14605 transitions. [2022-07-12 01:21:15,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-12 01:21:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 12053 states and 14605 transitions. [2022-07-12 01:21:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2022-07-12 01:21:15,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:15,457 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:21:15,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 01:21:15,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2071206007, now seen corresponding path program 1 times [2022-07-12 01:21:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:15,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508864753] [2022-07-12 01:21:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 125 proven. 269 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:21:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:15,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508864753] [2022-07-12 01:21:15,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508864753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:21:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082570341] [2022-07-12 01:21:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:15,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:21:15,755 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-12 01:21:15,790 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-12 01:21:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:16,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:21:16,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:21:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:21:16,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:21:16,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082570341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:16,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:21:16,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:21:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958214985] [2022-07-12 01:21:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:16,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:16,470 INFO L87 Difference]: Start difference. First operand 12053 states and 14605 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-12 01:21:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:18,029 INFO L93 Difference]: Finished difference Result 23807 states and 28906 transitions. [2022-07-12 01:21:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 610 [2022-07-12 01:21:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:18,048 INFO L225 Difference]: With dead ends: 23807 [2022-07-12 01:21:18,049 INFO L226 Difference]: Without dead ends: 12055 [2022-07-12 01:21:18,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:18,060 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 115 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:18,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 443 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:21:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2022-07-12 01:21:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 12051. [2022-07-12 01:21:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12051 states, 12050 states have (on average 1.183402489626556) internal successors, (14260), 12050 states have internal predecessors, (14260), 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-12 01:21:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12051 states to 12051 states and 14260 transitions. [2022-07-12 01:21:18,200 INFO L78 Accepts]: Start accepts. Automaton has 12051 states and 14260 transitions. Word has length 610 [2022-07-12 01:21:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:18,200 INFO L495 AbstractCegarLoop]: Abstraction has 12051 states and 14260 transitions. [2022-07-12 01:21:18,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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-12 01:21:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12051 states and 14260 transitions. [2022-07-12 01:21:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-07-12 01:21:18,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:18,210 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2022-07-12 01:21:18,236 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-12 01:21:18,423 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,SelfDestructingSolverStorable14 [2022-07-12 01:21:18,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1941336849, now seen corresponding path program 1 times [2022-07-12 01:21:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901294651] [2022-07-12 01:21:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 619 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-07-12 01:21:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901294651] [2022-07-12 01:21:18,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901294651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:21:18,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069709341] [2022-07-12 01:21:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:18,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:21:18,703 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-12 01:21:18,729 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-12 01:21:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:18,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:21:18,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:21:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 01:21:19,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:21:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069709341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:19,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:21:19,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:21:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738795929] [2022-07-12 01:21:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:19,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:19,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:19,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:19,015 INFO L87 Difference]: Start difference. First operand 12051 states and 14260 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-12 01:21:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:20,583 INFO L93 Difference]: Finished difference Result 26792 states and 32329 transitions. [2022-07-12 01:21:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 629 [2022-07-12 01:21:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:20,611 INFO L225 Difference]: With dead ends: 26792 [2022-07-12 01:21:20,612 INFO L226 Difference]: Without dead ends: 15042 [2022-07-12 01:21:20,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:20,623 INFO L413 NwaCegarLoop]: 588 mSDtfsCounter, 259 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:20,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 626 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:21:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15042 states. [2022-07-12 01:21:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15042 to 14444. [2022-07-12 01:21:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.167832167832168) internal successors, (16867), 14443 states have internal predecessors, (16867), 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-12 01:21:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 16867 transitions. [2022-07-12 01:21:20,811 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 16867 transitions. Word has length 629 [2022-07-12 01:21:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:20,811 INFO L495 AbstractCegarLoop]: Abstraction has 14444 states and 16867 transitions. [2022-07-12 01:21:20,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-12 01:21:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 16867 transitions. [2022-07-12 01:21:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2022-07-12 01:21:20,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:20,826 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-12 01:21:20,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 01:21:21,050 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,SelfDestructingSolverStorable15 [2022-07-12 01:21:21,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash -599106639, now seen corresponding path program 1 times [2022-07-12 01:21:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:21,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005360854] [2022-07-12 01:21:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-12 01:21:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005360854] [2022-07-12 01:21:21,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005360854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:21:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068858640] [2022-07-12 01:21:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:21,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:21,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:21:21,332 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-12 01:21:21,354 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-12 01:21:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:21,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 01:21:21,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:21:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-12 01:21:22,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:21:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-07-12 01:21:22,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068858640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:21:22,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:21:22,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-12 01:21:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26770767] [2022-07-12 01:21:22,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:21:22,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:21:22,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:22,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:21:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:21:22,898 INFO L87 Difference]: Start difference. First operand 14444 states and 16867 transitions. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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-12 01:21:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:28,136 INFO L93 Difference]: Finished difference Result 36219 states and 41865 transitions. [2022-07-12 01:21:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 01:21:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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 686 [2022-07-12 01:21:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:28,157 INFO L225 Difference]: With dead ends: 36219 [2022-07-12 01:21:28,157 INFO L226 Difference]: Without dead ends: 16837 [2022-07-12 01:21:28,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1366 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-07-12 01:21:28,173 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 3108 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5237 mSolverCounterSat, 641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 641 IncrementalHoareTripleChecker+Valid, 5237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:28,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3108 Valid, 236 Invalid, 5878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [641 Valid, 5237 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 01:21:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16837 states. [2022-07-12 01:21:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16837 to 16834. [2022-07-12 01:21:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16834 states, 16833 states have (on average 1.058694231568942) internal successors, (17821), 16833 states have internal predecessors, (17821), 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-12 01:21:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16834 states to 16834 states and 17821 transitions. [2022-07-12 01:21:28,416 INFO L78 Accepts]: Start accepts. Automaton has 16834 states and 17821 transitions. Word has length 686 [2022-07-12 01:21:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:28,417 INFO L495 AbstractCegarLoop]: Abstraction has 16834 states and 17821 transitions. [2022-07-12 01:21:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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-12 01:21:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16834 states and 17821 transitions. [2022-07-12 01:21:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2022-07-12 01:21:28,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:28,428 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:21:28,455 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-12 01:21:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:28,644 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 410633746, now seen corresponding path program 1 times [2022-07-12 01:21:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498636798] [2022-07-12 01:21:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 01:21:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498636798] [2022-07-12 01:21:28,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498636798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:28,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:28,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:21:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926002749] [2022-07-12 01:21:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:21:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:21:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:21:28,900 INFO L87 Difference]: Start difference. First operand 16834 states and 17821 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-12 01:21:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:30,337 INFO L93 Difference]: Finished difference Result 35468 states and 37501 transitions. [2022-07-12 01:21:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:21:30,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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 686 [2022-07-12 01:21:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:30,364 INFO L225 Difference]: With dead ends: 35468 [2022-07-12 01:21:30,366 INFO L226 Difference]: Without dead ends: 18935 [2022-07-12 01:21:30,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:21:30,379 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 582 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:30,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 425 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 01:21:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18935 states. [2022-07-12 01:21:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18935 to 18931. [2022-07-12 01:21:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18931 states, 18930 states have (on average 1.0426307448494454) internal successors, (19737), 18930 states have internal predecessors, (19737), 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-12 01:21:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18931 states to 18931 states and 19737 transitions. [2022-07-12 01:21:30,639 INFO L78 Accepts]: Start accepts. Automaton has 18931 states and 19737 transitions. Word has length 686 [2022-07-12 01:21:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:30,640 INFO L495 AbstractCegarLoop]: Abstraction has 18931 states and 19737 transitions. [2022-07-12 01:21:30,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-12 01:21:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 18931 states and 19737 transitions. [2022-07-12 01:21:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2022-07-12 01:21:30,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:30,649 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:21:30,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 01:21:30,649 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 908850648, now seen corresponding path program 1 times [2022-07-12 01:21:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:30,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252694245] [2022-07-12 01:21:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2022-07-12 01:21:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:30,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252694245] [2022-07-12 01:21:30,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252694245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:30,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:30,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281394291] [2022-07-12 01:21:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:30,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:30,919 INFO L87 Difference]: Start difference. First operand 18931 states and 19737 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-12 01:21:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:31,863 INFO L93 Difference]: Finished difference Result 40563 states and 42304 transitions. [2022-07-12 01:21:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:31,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 726 [2022-07-12 01:21:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:31,886 INFO L225 Difference]: With dead ends: 40563 [2022-07-12 01:21:31,886 INFO L226 Difference]: Without dead ends: 21933 [2022-07-12 01:21:31,899 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-12 01:21:31,900 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 346 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:31,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 122 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 01:21:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21933 states. [2022-07-12 01:21:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21933 to 20425. [2022-07-12 01:21:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20425 states, 20424 states have (on average 1.0399040344692518) internal successors, (21239), 20424 states have internal predecessors, (21239), 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-12 01:21:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20425 states to 20425 states and 21239 transitions. [2022-07-12 01:21:32,182 INFO L78 Accepts]: Start accepts. Automaton has 20425 states and 21239 transitions. Word has length 726 [2022-07-12 01:21:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:32,182 INFO L495 AbstractCegarLoop]: Abstraction has 20425 states and 21239 transitions. [2022-07-12 01:21:32,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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-12 01:21:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20425 states and 21239 transitions. [2022-07-12 01:21:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2022-07-12 01:21:32,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:32,193 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:21:32,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 01:21:32,193 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash -586254201, now seen corresponding path program 1 times [2022-07-12 01:21:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:32,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865982094] [2022-07-12 01:21:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 583 proven. 188 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-12 01:21:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865982094] [2022-07-12 01:21:32,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865982094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:21:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036022828] [2022-07-12 01:21:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:32,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:32,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:21:32,532 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-12 01:21:32,575 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-12 01:21:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:32,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:21:32,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:21:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2022-07-12 01:21:34,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:21:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036022828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:34,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:21:34,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:21:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315303024] [2022-07-12 01:21:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:34,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:34,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:34,043 INFO L87 Difference]: Start difference. First operand 20425 states and 21239 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-12 01:21:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:34,134 INFO L93 Difference]: Finished difference Result 20429 states and 21242 transitions. [2022-07-12 01:21:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 756 [2022-07-12 01:21:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:34,157 INFO L225 Difference]: With dead ends: 20429 [2022-07-12 01:21:34,158 INFO L226 Difference]: Without dead ends: 20427 [2022-07-12 01:21:34,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:21:34,165 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 239 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:34,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 522 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 766 Unchecked, 0.0s Time] [2022-07-12 01:21:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20427 states. [2022-07-12 01:21:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20427 to 20126. [2022-07-12 01:21:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20126 states, 20125 states have (on average 1.039751552795031) internal successors, (20925), 20125 states have internal predecessors, (20925), 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-12 01:21:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 20925 transitions. [2022-07-12 01:21:34,424 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 20925 transitions. Word has length 756 [2022-07-12 01:21:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:34,424 INFO L495 AbstractCegarLoop]: Abstraction has 20126 states and 20925 transitions. [2022-07-12 01:21:34,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-12 01:21:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 20925 transitions. [2022-07-12 01:21:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2022-07-12 01:21:34,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:34,441 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:21:34,470 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-12 01:21:34,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:21:34,656 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -176504871, now seen corresponding path program 1 times [2022-07-12 01:21:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919392971] [2022-07-12 01:21:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 714 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-12 01:21:35,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:35,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919392971] [2022-07-12 01:21:35,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919392971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:35,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:35,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656133180] [2022-07-12 01:21:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:35,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:35,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:35,021 INFO L87 Difference]: Start difference. First operand 20126 states and 20925 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-12 01:21:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:35,811 INFO L93 Difference]: Finished difference Result 33624 states and 34867 transitions. [2022-07-12 01:21:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 813 [2022-07-12 01:21:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:35,827 INFO L225 Difference]: With dead ends: 33624 [2022-07-12 01:21:35,827 INFO L226 Difference]: Without dead ends: 13799 [2022-07-12 01:21:35,837 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-12 01:21:35,838 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 223 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:35,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 357 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 01:21:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-07-12 01:21:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11403. [2022-07-12 01:21:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11403 states, 11402 states have (on average 1.0329766707595158) internal successors, (11778), 11402 states have internal predecessors, (11778), 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-12 01:21:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11403 states to 11403 states and 11778 transitions. [2022-07-12 01:21:35,978 INFO L78 Accepts]: Start accepts. Automaton has 11403 states and 11778 transitions. Word has length 813 [2022-07-12 01:21:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:35,979 INFO L495 AbstractCegarLoop]: Abstraction has 11403 states and 11778 transitions. [2022-07-12 01:21:35,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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-12 01:21:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11403 states and 11778 transitions. [2022-07-12 01:21:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2022-07-12 01:21:35,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:21:35,989 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 3, 3, 3, 3, 3, 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, 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] [2022-07-12 01:21:35,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 01:21:35,990 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:21:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:21:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1105125242, now seen corresponding path program 1 times [2022-07-12 01:21:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:21:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879341605] [2022-07-12 01:21:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:21:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:21:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:21:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2022-07-12 01:21:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:21:36,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879341605] [2022-07-12 01:21:36,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879341605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:21:36,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:21:36,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:21:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211446934] [2022-07-12 01:21:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:21:36,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:21:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:21:36,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:21:36,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:21:36,302 INFO L87 Difference]: Start difference. First operand 11403 states and 11778 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-12 01:21:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:21:37,157 INFO L93 Difference]: Finished difference Result 22501 states and 23237 transitions. [2022-07-12 01:21:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:21:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 841 [2022-07-12 01:21:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:21:37,158 INFO L225 Difference]: With dead ends: 22501 [2022-07-12 01:21:37,158 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 01:21:37,166 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-12 01:21:37,166 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 323 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:21:37,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 393 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 01:21:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 01:21:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 01:21:37,167 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-12 01:21:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 01:21:37,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 841 [2022-07-12 01:21:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:21:37,168 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 01:21:37,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-12 01:21:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 01:21:37,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 01:21:37,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 01:21:37,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 01:21:37,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed. [2022-07-12 01:21:44,179 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,180 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed. [2022-07-12 01:21:44,181 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,182 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,183 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,184 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,185 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,186 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,187 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-07-12 01:21:44,188 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,189 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,190 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2022-07-12 01:21:44,191 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed. [2022-07-12 01:21:44,192 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,193 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,194 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,195 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed. [2022-07-12 01:21:44,196 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-12 01:21:44,197 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,198 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,199 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed. [2022-07-12 01:21:44,200 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-07-12 01:21:44,201 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,202 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L895 garLoopResultBuilder]: At program point L1767(lines 1668 1768) the Hoare annotation is: (let ((.cse8 (<= (+ 89 ~a4~0) 0)) (.cse3 (<= 0 (+ ~a29~0 127))) (.cse14 (<= 0 (+ ~a0~0 60))) (.cse4 (<= (+ ~a4~0 86) 0))) (let ((.cse2 (= 3 ~a2~0)) (.cse12 (or (and .cse3 .cse8) (and .cse3 .cse14 .cse4))) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse5 (= ~a2~0 1)) (.cse6 (<= ~a29~0 43)) (.cse1 (<= (+ 98 ~a0~0) 0)) (.cse15 (<= ~a2~0 2)) (.cse13 (<= 5 ~a2~0)) (.cse17 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse16 (<= 44 ~a29~0)) (.cse7 (<= 2 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse6 (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse9 (mod (+ (div .cse10 10) 1) 63))) (and (<= .cse9 (+ ~a29~0 143)) (not (= (mod .cse10 10) 0)) (not (= .cse9 0)) (< .cse10 0)))))) (and .cse0 .cse7 (<= (+ ~a0~0 147) 0)) (and .cse7 .cse3 .cse8 .cse11) (and .cse12 .cse13) (and .cse7 .cse12 .cse6) (and .cse7 (or (and .cse14 .cse4 .cse15) (and .cse8 .cse15))) (and .cse0 .cse5 .cse6 .cse11) (and .cse5 .cse4 .cse11) (and .cse0 .cse1 .cse5) (and .cse7 .cse8 (not .cse1) .cse6) (and .cse0 .cse3 .cse1 .cse13) (and .cse16 .cse7 .cse1 .cse15) (and .cse0 .cse7 .cse3 .cse1 .cse15) (and .cse8 .cse13) (and .cse17 .cse0 .cse13) (and .cse17 .cse0 .cse16 .cse7)))) [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,203 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed. [2022-07-12 01:21:44,204 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed. [2022-07-12 01:21:44,205 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L895 garLoopResultBuilder]: At program point L1776-2(lines 1776 1785) the Hoare annotation is: (let ((.cse8 (<= (+ 89 ~a4~0) 0)) (.cse3 (<= 0 (+ ~a29~0 127))) (.cse14 (<= 0 (+ ~a0~0 60))) (.cse4 (<= (+ ~a4~0 86) 0))) (let ((.cse2 (= 3 ~a2~0)) (.cse12 (or (and .cse3 .cse8) (and .cse3 .cse14 .cse4))) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse6 (<= ~a29~0 43)) (.cse5 (= ~a2~0 1)) (.cse1 (<= (+ 98 ~a0~0) 0)) (.cse15 (<= ~a2~0 2)) (.cse13 (<= 5 ~a2~0)) (.cse17 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse16 (<= 44 ~a29~0)) (.cse7 (<= 2 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse6 (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse9 (mod (+ (div .cse10 10) 1) 63))) (and (<= .cse9 (+ ~a29~0 143)) (not (= (mod .cse10 10) 0)) (not (= .cse9 0)) (< .cse10 0)))))) (and .cse0 .cse7 (<= (+ ~a0~0 147) 0)) (and .cse7 .cse3 .cse8 .cse11) (and .cse12 .cse13) (and .cse7 .cse12 .cse6) (and .cse7 (or (and .cse14 .cse4 .cse15) (and .cse8 .cse15))) (and .cse0 .cse5 .cse6 .cse11) (and .cse5 .cse4 .cse11) (and .cse0 .cse1 .cse5) (and .cse7 .cse8 (not .cse1) .cse6) (and .cse0 .cse3 .cse1 .cse13) (and .cse5 .cse4 (<= (+ ~a29~0 144) 0)) (and .cse16 .cse7 .cse1 .cse15) (and .cse0 .cse7 .cse3 .cse1 .cse15) (and .cse8 .cse13) (and .cse17 .cse0 .cse13) (and .cse17 .cse0 .cse16 .cse7)))) [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,206 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed. [2022-07-12 01:21:44,207 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-07-12 01:21:44,208 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,209 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,210 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,211 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,212 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-07-12 01:21:44,213 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,214 INFO L895 garLoopResultBuilder]: At program point L1665(lines 33 1666) the Hoare annotation is: (let ((.cse8 (<= (+ 89 ~a4~0) 0)) (.cse3 (<= 0 (+ ~a29~0 127))) (.cse14 (<= 0 (+ ~a0~0 60))) (.cse4 (<= (+ ~a4~0 86) 0))) (let ((.cse2 (= 3 ~a2~0)) (.cse12 (or (and .cse3 .cse8) (and .cse3 .cse14 .cse4))) (.cse11 (<= (+ ~a0~0 61) 0)) (.cse6 (<= ~a29~0 43)) (.cse5 (= ~a2~0 1)) (.cse1 (<= (+ 98 ~a0~0) 0)) (.cse15 (<= ~a2~0 2)) (.cse13 (<= 5 ~a2~0)) (.cse17 (<= (+ 104 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse16 (<= 44 ~a29~0)) (.cse7 (<= 2 ~a2~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse6 (exists ((v_~a29~0_899 Int)) (let ((.cse10 (* 9 v_~a29~0_899))) (let ((.cse9 (mod (+ (div .cse10 10) 1) 63))) (and (<= .cse9 (+ ~a29~0 143)) (not (= (mod .cse10 10) 0)) (not (= .cse9 0)) (< .cse10 0)))))) (and .cse0 .cse7 (<= (+ ~a0~0 147) 0)) (and .cse7 .cse3 .cse8 .cse11) (and .cse12 .cse13) (and .cse7 .cse12 .cse6) (and .cse7 (or (and .cse14 .cse4 .cse15) (and .cse8 .cse15))) (and .cse0 .cse5 .cse6 .cse11) (and .cse5 .cse4 .cse11) (and .cse0 .cse1 .cse5) (and .cse7 .cse8 (not .cse1) .cse6) (and .cse0 .cse3 .cse1 .cse13) (and .cse5 .cse4 (<= (+ ~a29~0 144) 0)) (and .cse16 .cse7 .cse1 .cse15) (and .cse0 .cse7 .cse3 .cse1 .cse15) (and .cse8 .cse13) (and .cse17 .cse0 .cse13) (and .cse17 .cse0 .cse16 .cse7)))) [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,215 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed. [2022-07-12 01:21:44,216 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-12 01:21:44,217 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,218 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,219 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-07-12 01:21:44,220 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,221 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,222 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-07-12 01:21:44,223 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed. [2022-07-12 01:21:44,226 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:21:44,228 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 01:21:44,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:21:44 BoogieIcfgContainer [2022-07-12 01:21:44,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 01:21:44,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 01:21:44,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 01:21:44,260 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 01:21:44,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:20:47" (3/4) ... [2022-07-12 01:21:44,263 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 01:21:44,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 01:21:44,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 01:21:44,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 01:21:44,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 01:21:44,318 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) [2022-07-12 01:21:44,321 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) [2022-07-12 01:21:44,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) [2022-07-12 01:21:44,461 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 01:21:44,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 01:21:44,464 INFO L158 Benchmark]: Toolchain (without parser) took 60697.64ms. Allocated memory was 100.7MB in the beginning and 979.4MB in the end (delta: 878.7MB). Free memory was 73.6MB in the beginning and 450.7MB in the end (delta: -377.1MB). Peak memory consumption was 502.9MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,464 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 75.5MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 01:21:44,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 904.10ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 52.2MB in the end (delta: 21.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.42ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 52.2MB in the beginning and 61.8MB in the end (delta: -9.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,465 INFO L158 Benchmark]: Boogie Preprocessor took 258.81ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 61.4MB in the end (delta: 373.7kB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,465 INFO L158 Benchmark]: RCFGBuilder took 2643.90ms. Allocated memory was 125.8MB in the beginning and 251.7MB in the end (delta: 125.8MB). Free memory was 60.9MB in the beginning and 157.7MB in the end (delta: -96.8MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,468 INFO L158 Benchmark]: TraceAbstraction took 56450.00ms. Allocated memory was 251.7MB in the beginning and 979.4MB in the end (delta: 727.7MB). Free memory was 156.7MB in the beginning and 475.9MB in the end (delta: -319.2MB). Peak memory consumption was 607.2MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,468 INFO L158 Benchmark]: Witness Printer took 203.13ms. Allocated memory is still 979.4MB. Free memory was 475.9MB in the beginning and 450.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-12 01:21:44,476 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.22ms. Allocated memory is still 75.5MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 904.10ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 52.2MB in the end (delta: 21.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.42ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 52.2MB in the beginning and 61.8MB in the end (delta: -9.5MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 258.81ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 61.4MB in the end (delta: 373.7kB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2643.90ms. Allocated memory was 125.8MB in the beginning and 251.7MB in the end (delta: 125.8MB). Free memory was 60.9MB in the beginning and 157.7MB in the end (delta: -96.8MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. * TraceAbstraction took 56450.00ms. Allocated memory was 251.7MB in the beginning and 979.4MB in the end (delta: 727.7MB). Free memory was 156.7MB in the beginning and 475.9MB in the end (delta: -319.2MB). Peak memory consumption was 607.2MB. Max. memory is 16.1GB. * Witness Printer took 203.13ms. Allocated memory is still 979.4MB. Free memory was 475.9MB in the beginning and 450.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] * 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: 212]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.4s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8960 SdHoareTripleChecker+Valid, 32.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8960 mSDsluCounter, 7679 SdHoareTripleChecker+Invalid, 27.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 766 IncrementalHoareTripleChecker+Unchecked, 952 mSDsCounter, 4721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25199 IncrementalHoareTripleChecker+Invalid, 30686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4721 mSolverCounterUnsat, 6727 mSDtfsCounter, 25199 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3441 GetRequests, 3390 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20425occurred in iteration=19, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 17483 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 177 NumberOfFragments, 1184 HoareAnnotationTreeSize, 4 FomulaSimplifications, 25464 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 73818 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 13744 NumberOfCodeBlocks, 13744 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 14403 ConstructedInterpolants, 63 QuantifiedInterpolants, 45704 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3259 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 16035/16648 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: 1770]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1668]: Loop Invariant [2022-07-12 01:21:44,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,496 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,503 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: (((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) - InvariantResult [Line: 1776]: Loop Invariant [2022-07-12 01:21:44,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,505 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,506 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,507 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) - InvariantResult [Line: 33]: Loop Invariant [2022-07-12 01:21:44,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,508 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,509 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:21:44,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((42 + a4 <= 0 && 98 + a0 <= 0) && 3 == a2) || ((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((2 <= a2 && 89 + a4 <= 0) && a29 <= 43) && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0))) || ((42 + a4 <= 0 && 2 <= a2) && a0 + 147 <= 0)) || (((2 <= a2 && 0 <= a29 + 127) && 89 + a4 <= 0) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2)) || ((2 <= a2 && ((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0))) && a29 <= 43)) || (2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)))) || (((42 + a4 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((42 + a4 <= 0 && 98 + a0 <= 0) && a2 == 1)) || (((2 <= a2 && 89 + a4 <= 0) && !(98 + a0 <= 0)) && a29 <= 43)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && 98 + a0 <= 0) && 5 <= a2)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || (((44 <= a29 && 2 <= a2) && 98 + a0 <= 0) && a2 <= 2)) || ((((42 + a4 <= 0 && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && a2 <= 2)) || (89 + a4 <= 0 && 5 <= a2)) || ((104 + a0 <= 0 && 42 + a4 <= 0) && 5 <= a2)) || (((104 + a0 <= 0 && 42 + a4 <= 0) && 44 <= a29) && 2 <= a2) RESULT: Ultimate proved your program to be correct! [2022-07-12 01:21:44,530 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