/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/eca-rers2012/Problem14_label14.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 04:18:17,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 04:18:17,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 04:18:17,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 04:18:17,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 04:18:17,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 04:18:17,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 04:18:17,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 04:18:17,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 04:18:17,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 04:18:17,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 04:18:17,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 04:18:17,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 04:18:17,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 04:18:17,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 04:18:17,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 04:18:17,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 04:18:17,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 04:18:17,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 04:18:17,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 04:18:17,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 04:18:17,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 04:18:17,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 04:18:17,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 04:18:17,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 04:18:17,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 04:18:17,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 04:18:17,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 04:18:17,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 04:18:17,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 04:18:17,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 04:18:17,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 04:18:17,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 04:18:17,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 04:18:17,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 04:18:17,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 04:18:17,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 04:18:17,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 04:18:17,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 04:18:17,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 04:18:17,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 04:18:17,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 04:18:17,604 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 04:18:17,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 04:18:17,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 04:18:17,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 04:18:17,609 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 04:18:17,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 04:18:17,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 04:18:17,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 04:18:17,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 04:18:17,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 04:18:17,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 04:18:17,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 04:18:17,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 04:18:17,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 04:18:17,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 04:18:17,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 04:18:17,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 04:18:17,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:18:17,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 04:18:17,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 04:18:17,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 04:18:17,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 04:18:17,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 04:18:17,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 04:18:17,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 04:18:17,614 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-bitabs/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 [2020-12-23 04:18:18,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 04:18:18,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 04:18:18,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 04:18:18,078 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 04:18:18,079 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 04:18:18,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label14.c [2020-12-23 04:18:18,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac141d523/3657731bdd3f42e2a60394ebc4577431/FLAGc233d6b2d [2020-12-23 04:18:18,929 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 04:18:18,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label14.c [2020-12-23 04:18:18,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac141d523/3657731bdd3f42e2a60394ebc4577431/FLAGc233d6b2d [2020-12-23 04:18:19,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac141d523/3657731bdd3f42e2a60394ebc4577431 [2020-12-23 04:18:19,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 04:18:19,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 04:18:19,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 04:18:19,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 04:18:19,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 04:18:19,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:18:19" (1/1) ... [2020-12-23 04:18:19,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d06f6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:19, skipping insertion in model container [2020-12-23 04:18:19,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:18:19" (1/1) ... [2020-12-23 04:18:19,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 04:18:19,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 04:18:19,557 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label14.c[2862,2875] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 04:18:19,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:18:19,855 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 04:18:19,901 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label14.c[2862,2875] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 04:18:20,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:18:20,183 INFO L208 MainTranslator]: Completed translation [2020-12-23 04:18:20,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20 WrapperNode [2020-12-23 04:18:20,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 04:18:20,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 04:18:20,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 04:18:20,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 04:18:20,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 04:18:20,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 04:18:20,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 04:18:20,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 04:18:20,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... [2020-12-23 04:18:20,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 04:18:20,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 04:18:20,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 04:18:20,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 04:18:20,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:18:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 04:18:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 04:18:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 04:18:20,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 04:18:22,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 04:18:22,395 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 04:18:22,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:18:22 BoogieIcfgContainer [2020-12-23 04:18:22,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 04:18:22,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 04:18:22,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 04:18:22,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 04:18:22,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:18:19" (1/3) ... [2020-12-23 04:18:22,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bb4676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:18:22, skipping insertion in model container [2020-12-23 04:18:22,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:18:20" (2/3) ... [2020-12-23 04:18:22,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bb4676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:18:22, skipping insertion in model container [2020-12-23 04:18:22,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:18:22" (3/3) ... [2020-12-23 04:18:22,410 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label14.c [2020-12-23 04:18:22,418 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 04:18:22,425 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 04:18:22,447 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 04:18:22,482 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 04:18:22,482 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 04:18:22,482 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 04:18:22,483 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 04:18:22,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 04:18:22,483 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 04:18:22,483 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 04:18:22,483 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 04:18:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-23 04:18:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-23 04:18:22,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:22,516 INFO L422 BasicCegarLoop]: 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] [2020-12-23 04:18:22,517 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2020-12-23 04:18:22,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:22,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707363205] [2020-12-23 04:18:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:22,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707363205] [2020-12-23 04:18:22,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:22,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:18:22,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464346908] [2020-12-23 04:18:22,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:22,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:22,911 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-23 04:18:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:24,126 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2020-12-23 04:18:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:24,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-12-23 04:18:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:24,147 INFO L225 Difference]: With dead ends: 669 [2020-12-23 04:18:24,148 INFO L226 Difference]: Without dead ends: 360 [2020-12-23 04:18:24,153 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-23 04:18:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-23 04:18:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-23 04:18:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2020-12-23 04:18:24,230 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 26 [2020-12-23 04:18:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:24,231 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2020-12-23 04:18:24,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2020-12-23 04:18:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 04:18:24,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:24,235 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 04:18:24,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 04:18:24,236 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash 321162416, now seen corresponding path program 1 times [2020-12-23 04:18:24,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:24,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864254822] [2020-12-23 04:18:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:24,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864254822] [2020-12-23 04:18:24,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:24,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:18:24,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224966791] [2020-12-23 04:18:24,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:24,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:24,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:24,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:24,526 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand 3 states. [2020-12-23 04:18:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:25,497 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2020-12-23 04:18:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-12-23 04:18:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:25,505 INFO L225 Difference]: With dead ends: 1074 [2020-12-23 04:18:25,506 INFO L226 Difference]: Without dead ends: 716 [2020-12-23 04:18:25,508 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-23 04:18:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-23 04:18:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-23 04:18:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1089 transitions. [2020-12-23 04:18:25,587 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1089 transitions. Word has length 91 [2020-12-23 04:18:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:25,588 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 1089 transitions. [2020-12-23 04:18:25,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1089 transitions. [2020-12-23 04:18:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 04:18:25,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:25,595 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 04:18:25,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 04:18:25,596 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash -974947575, now seen corresponding path program 1 times [2020-12-23 04:18:25,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:25,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757975909] [2020-12-23 04:18:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:25,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757975909] [2020-12-23 04:18:25,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:25,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:18:25,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259325142] [2020-12-23 04:18:25,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:25,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:25,793 INFO L87 Difference]: Start difference. First operand 716 states and 1089 transitions. Second operand 3 states. [2020-12-23 04:18:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:26,982 INFO L93 Difference]: Finished difference Result 1786 states and 2718 transitions. [2020-12-23 04:18:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:26,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 04:18:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:26,992 INFO L225 Difference]: With dead ends: 1786 [2020-12-23 04:18:26,992 INFO L226 Difference]: Without dead ends: 1072 [2020-12-23 04:18:26,995 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-23 04:18:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2020-12-23 04:18:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-23 04:18:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1475 transitions. [2020-12-23 04:18:27,054 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1475 transitions. Word has length 92 [2020-12-23 04:18:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:27,054 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1475 transitions. [2020-12-23 04:18:27,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1475 transitions. [2020-12-23 04:18:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 04:18:27,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:27,058 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 04:18:27,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 04:18:27,058 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1697536284, now seen corresponding path program 1 times [2020-12-23 04:18:27,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:27,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805454595] [2020-12-23 04:18:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:27,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805454595] [2020-12-23 04:18:27,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:27,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 04:18:27,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656221007] [2020-12-23 04:18:27,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:27,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:27,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:27,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:27,181 INFO L87 Difference]: Start difference. First operand 1072 states and 1475 transitions. Second operand 3 states. [2020-12-23 04:18:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:28,188 INFO L93 Difference]: Finished difference Result 2854 states and 3878 transitions. [2020-12-23 04:18:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:28,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 04:18:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:28,198 INFO L225 Difference]: With dead ends: 2854 [2020-12-23 04:18:28,199 INFO L226 Difference]: Without dead ends: 1784 [2020-12-23 04:18:28,201 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-23 04:18:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1428. [2020-12-23 04:18:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-23 04:18:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1873 transitions. [2020-12-23 04:18:28,244 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1873 transitions. Word has length 94 [2020-12-23 04:18:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:28,245 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1873 transitions. [2020-12-23 04:18:28,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1873 transitions. [2020-12-23 04:18:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 04:18:28,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:28,249 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 04:18:28,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 04:18:28,249 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:28,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash -256152627, now seen corresponding path program 1 times [2020-12-23 04:18:28,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:28,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914650682] [2020-12-23 04:18:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:28,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914650682] [2020-12-23 04:18:28,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:28,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:28,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940487333] [2020-12-23 04:18:28,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:28,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:28,458 INFO L87 Difference]: Start difference. First operand 1428 states and 1873 transitions. Second operand 4 states. [2020-12-23 04:18:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:29,946 INFO L93 Difference]: Finished difference Result 3388 states and 4344 transitions. [2020-12-23 04:18:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:29,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-23 04:18:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:29,959 INFO L225 Difference]: With dead ends: 3388 [2020-12-23 04:18:29,960 INFO L226 Difference]: Without dead ends: 1962 [2020-12-23 04:18:29,963 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-12-23 04:18:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2020-12-23 04:18:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-23 04:18:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2247 transitions. [2020-12-23 04:18:30,008 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2247 transitions. Word has length 105 [2020-12-23 04:18:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:30,008 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2247 transitions. [2020-12-23 04:18:30,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2247 transitions. [2020-12-23 04:18:30,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-12-23 04:18:30,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:30,012 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:30,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 04:18:30,012 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 592580129, now seen corresponding path program 1 times [2020-12-23 04:18:30,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:30,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841735969] [2020-12-23 04:18:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:30,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841735969] [2020-12-23 04:18:30,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:30,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:30,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189841634] [2020-12-23 04:18:30,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:30,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:30,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:30,267 INFO L87 Difference]: Start difference. First operand 1784 states and 2247 transitions. Second operand 4 states. [2020-12-23 04:18:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:31,371 INFO L93 Difference]: Finished difference Result 3773 states and 4735 transitions. [2020-12-23 04:18:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:31,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2020-12-23 04:18:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:31,384 INFO L225 Difference]: With dead ends: 3773 [2020-12-23 04:18:31,385 INFO L226 Difference]: Without dead ends: 2140 [2020-12-23 04:18:31,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-23 04:18:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-23 04:18:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:18:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2434 transitions. [2020-12-23 04:18:31,440 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2434 transitions. Word has length 185 [2020-12-23 04:18:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:31,441 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2434 transitions. [2020-12-23 04:18:31,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2434 transitions. [2020-12-23 04:18:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-12-23 04:18:31,445 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:31,445 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:31,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 04:18:31,446 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1648638209, now seen corresponding path program 1 times [2020-12-23 04:18:31,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:31,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289059086] [2020-12-23 04:18:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 182 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:18:31,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289059086] [2020-12-23 04:18:31,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355866491] [2020-12-23 04:18:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:32,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:32,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-23 04:18:32,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:32,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:18:32,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020342766] [2020-12-23 04:18:32,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:32,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:32,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:32,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:18:32,967 INFO L87 Difference]: Start difference. First operand 2140 states and 2434 transitions. Second operand 4 states. [2020-12-23 04:18:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:34,094 INFO L93 Difference]: Finished difference Result 4100 states and 4687 transitions. [2020-12-23 04:18:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:34,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2020-12-23 04:18:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:34,107 INFO L225 Difference]: With dead ends: 4100 [2020-12-23 04:18:34,107 INFO L226 Difference]: Without dead ends: 2140 [2020-12-23 04:18:34,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:18:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-23 04:18:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-23 04:18:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:18:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2415 transitions. [2020-12-23 04:18:34,167 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2415 transitions. Word has length 306 [2020-12-23 04:18:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:34,169 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2415 transitions. [2020-12-23 04:18:34,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2415 transitions. [2020-12-23 04:18:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2020-12-23 04:18:34,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:34,176 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:34,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 04:18:34,391 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1444073114, now seen corresponding path program 1 times [2020-12-23 04:18:34,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:34,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886457688] [2020-12-23 04:18:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-23 04:18:34,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886457688] [2020-12-23 04:18:34,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:34,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:34,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152471551] [2020-12-23 04:18:34,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:34,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:34,874 INFO L87 Difference]: Start difference. First operand 2140 states and 2415 transitions. Second operand 3 states. [2020-12-23 04:18:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:35,757 INFO L93 Difference]: Finished difference Result 4634 states and 5266 transitions. [2020-12-23 04:18:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:35,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2020-12-23 04:18:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:35,773 INFO L225 Difference]: With dead ends: 4634 [2020-12-23 04:18:35,773 INFO L226 Difference]: Without dead ends: 2674 [2020-12-23 04:18:35,777 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2020-12-23 04:18:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2020-12-23 04:18:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2020-12-23 04:18:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2810 transitions. [2020-12-23 04:18:35,834 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2810 transitions. Word has length 316 [2020-12-23 04:18:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:35,835 INFO L481 AbstractCegarLoop]: Abstraction has 2496 states and 2810 transitions. [2020-12-23 04:18:35,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2810 transitions. [2020-12-23 04:18:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2020-12-23 04:18:35,841 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:35,841 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:35,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 04:18:35,842 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1986254963, now seen corresponding path program 1 times [2020-12-23 04:18:35,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:35,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546617518] [2020-12-23 04:18:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2020-12-23 04:18:36,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546617518] [2020-12-23 04:18:36,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:36,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:36,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651963972] [2020-12-23 04:18:36,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:36,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:36,070 INFO L87 Difference]: Start difference. First operand 2496 states and 2810 transitions. Second operand 3 states. [2020-12-23 04:18:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:36,934 INFO L93 Difference]: Finished difference Result 5524 states and 6319 transitions. [2020-12-23 04:18:36,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:36,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2020-12-23 04:18:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:36,960 INFO L225 Difference]: With dead ends: 5524 [2020-12-23 04:18:36,961 INFO L226 Difference]: Without dead ends: 3208 [2020-12-23 04:18:36,966 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2020-12-23 04:18:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2674. [2020-12-23 04:18:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2020-12-23 04:18:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3019 transitions. [2020-12-23 04:18:37,039 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3019 transitions. Word has length 317 [2020-12-23 04:18:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:37,040 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 3019 transitions. [2020-12-23 04:18:37,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3019 transitions. [2020-12-23 04:18:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2020-12-23 04:18:37,050 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:37,050 INFO L422 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:37,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 04:18:37,051 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash -633980486, now seen corresponding path program 1 times [2020-12-23 04:18:37,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:37,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579117882] [2020-12-23 04:18:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2020-12-23 04:18:37,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579117882] [2020-12-23 04:18:37,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:37,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:37,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872858491] [2020-12-23 04:18:37,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:37,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:37,691 INFO L87 Difference]: Start difference. First operand 2674 states and 3019 transitions. Second operand 4 states. [2020-12-23 04:18:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:38,679 INFO L93 Difference]: Finished difference Result 5375 states and 6076 transitions. [2020-12-23 04:18:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:38,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2020-12-23 04:18:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:38,695 INFO L225 Difference]: With dead ends: 5375 [2020-12-23 04:18:38,696 INFO L226 Difference]: Without dead ends: 2852 [2020-12-23 04:18:38,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-12-23 04:18:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2020-12-23 04:18:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2020-12-23 04:18:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2899 transitions. [2020-12-23 04:18:38,768 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2899 transitions. Word has length 396 [2020-12-23 04:18:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:38,769 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 2899 transitions. [2020-12-23 04:18:38,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2899 transitions. [2020-12-23 04:18:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2020-12-23 04:18:38,778 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:38,779 INFO L422 BasicCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:38,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 04:18:38,779 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1999262927, now seen corresponding path program 1 times [2020-12-23 04:18:38,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:38,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024686803] [2020-12-23 04:18:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:39,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024686803] [2020-12-23 04:18:39,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:39,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:39,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673816926] [2020-12-23 04:18:39,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:39,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:39,228 INFO L87 Difference]: Start difference. First operand 2674 states and 2899 transitions. Second operand 3 states. [2020-12-23 04:18:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:40,109 INFO L93 Difference]: Finished difference Result 6058 states and 6629 transitions. [2020-12-23 04:18:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:40,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2020-12-23 04:18:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:40,127 INFO L225 Difference]: With dead ends: 6058 [2020-12-23 04:18:40,128 INFO L226 Difference]: Without dead ends: 3564 [2020-12-23 04:18:40,132 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2020-12-23 04:18:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2020-12-23 04:18:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-23 04:18:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3845 transitions. [2020-12-23 04:18:40,213 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3845 transitions. Word has length 419 [2020-12-23 04:18:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:40,214 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3845 transitions. [2020-12-23 04:18:40,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3845 transitions. [2020-12-23 04:18:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-12-23 04:18:40,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:40,224 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:40,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 04:18:40,225 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1260304558, now seen corresponding path program 1 times [2020-12-23 04:18:40,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:40,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329210312] [2020-12-23 04:18:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:40,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329210312] [2020-12-23 04:18:40,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:40,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:40,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950514532] [2020-12-23 04:18:40,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:40,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:40,625 INFO L87 Difference]: Start difference. First operand 3564 states and 3845 transitions. Second operand 3 states. [2020-12-23 04:18:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:41,444 INFO L93 Difference]: Finished difference Result 8550 states and 9306 transitions. [2020-12-23 04:18:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:41,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 460 [2020-12-23 04:18:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:41,485 INFO L225 Difference]: With dead ends: 8550 [2020-12-23 04:18:41,486 INFO L226 Difference]: Without dead ends: 5166 [2020-12-23 04:18:41,491 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2020-12-23 04:18:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2020-12-23 04:18:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-23 04:18:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5160 transitions. [2020-12-23 04:18:41,599 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5160 transitions. Word has length 460 [2020-12-23 04:18:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:41,600 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5160 transitions. [2020-12-23 04:18:41,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5160 transitions. [2020-12-23 04:18:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2020-12-23 04:18:41,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:41,619 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:41,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 04:18:41,619 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:41,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2037680378, now seen corresponding path program 1 times [2020-12-23 04:18:41,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:41,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292562572] [2020-12-23 04:18:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 989 proven. 104 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2020-12-23 04:18:42,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292562572] [2020-12-23 04:18:42,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829594199] [2020-12-23 04:18:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:42,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:18:42,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2020-12-23 04:18:43,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:43,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:18:43,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680287287] [2020-12-23 04:18:43,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:43,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:43,710 INFO L87 Difference]: Start difference. First operand 4810 states and 5160 transitions. Second operand 3 states. [2020-12-23 04:18:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:44,545 INFO L93 Difference]: Finished difference Result 5702 states and 6112 transitions. [2020-12-23 04:18:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:44,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 605 [2020-12-23 04:18:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:44,569 INFO L225 Difference]: With dead ends: 5702 [2020-12-23 04:18:44,570 INFO L226 Difference]: Without dead ends: 5700 [2020-12-23 04:18:44,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2020-12-23 04:18:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4810. [2020-12-23 04:18:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-23 04:18:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5160 transitions. [2020-12-23 04:18:44,684 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5160 transitions. Word has length 605 [2020-12-23 04:18:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:44,686 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5160 transitions. [2020-12-23 04:18:44,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5160 transitions. [2020-12-23 04:18:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2020-12-23 04:18:44,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:44,697 INFO L422 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2020-12-23 04:18:44,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 04:18:44,911 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1209889031, now seen corresponding path program 1 times [2020-12-23 04:18:44,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:44,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918549933] [2020-12-23 04:18:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 762 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:45,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918549933] [2020-12-23 04:18:45,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510082440] [2020-12-23 04:18:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:45,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 762 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-12-23 04:18:46,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 04:18:46,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 04:18:46,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741888299] [2020-12-23 04:18:46,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:18:46,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:18:46,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:46,520 INFO L87 Difference]: Start difference. First operand 4810 states and 5160 transitions. Second operand 4 states. [2020-12-23 04:18:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:47,732 INFO L93 Difference]: Finished difference Result 10686 states and 11499 transitions. [2020-12-23 04:18:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:18:47,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 615 [2020-12-23 04:18:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:47,755 INFO L225 Difference]: With dead ends: 10686 [2020-12-23 04:18:47,756 INFO L226 Difference]: Without dead ends: 6056 [2020-12-23 04:18:47,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:18:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-12-23 04:18:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5522. [2020-12-23 04:18:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2020-12-23 04:18:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5927 transitions. [2020-12-23 04:18:47,895 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5927 transitions. Word has length 615 [2020-12-23 04:18:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:47,898 INFO L481 AbstractCegarLoop]: Abstraction has 5522 states and 5927 transitions. [2020-12-23 04:18:47,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:18:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5927 transitions. [2020-12-23 04:18:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2020-12-23 04:18:47,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:47,908 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2020-12-23 04:18:48,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 04:18:48,123 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash -612090415, now seen corresponding path program 1 times [2020-12-23 04:18:48,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:48,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803867880] [2020-12-23 04:18:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 965 proven. 260 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2020-12-23 04:18:49,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803867880] [2020-12-23 04:18:49,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727493196] [2020-12-23 04:18:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:49,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:49,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 1016 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2020-12-23 04:18:50,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:50,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:18:50,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89468576] [2020-12-23 04:18:50,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:50,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:50,825 INFO L87 Difference]: Start difference. First operand 5522 states and 5927 transitions. Second operand 3 states. [2020-12-23 04:18:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:51,652 INFO L93 Difference]: Finished difference Result 10864 states and 11673 transitions. [2020-12-23 04:18:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:51,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 625 [2020-12-23 04:18:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:51,664 INFO L225 Difference]: With dead ends: 10864 [2020-12-23 04:18:51,665 INFO L226 Difference]: Without dead ends: 5522 [2020-12-23 04:18:51,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:18:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2020-12-23 04:18:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5166. [2020-12-23 04:18:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-23 04:18:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5530 transitions. [2020-12-23 04:18:51,762 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5530 transitions. Word has length 625 [2020-12-23 04:18:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:51,762 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5530 transitions. [2020-12-23 04:18:51,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5530 transitions. [2020-12-23 04:18:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2020-12-23 04:18:51,769 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:51,770 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2020-12-23 04:18:51,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:51,984 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2136798791, now seen corresponding path program 1 times [2020-12-23 04:18:51,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:51,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140828962] [2020-12-23 04:18:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2020-12-23 04:18:52,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140828962] [2020-12-23 04:18:52,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:52,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:52,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388570540] [2020-12-23 04:18:52,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:52,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:52,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:52,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:52,675 INFO L87 Difference]: Start difference. First operand 5166 states and 5530 transitions. Second operand 3 states. [2020-12-23 04:18:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:53,582 INFO L93 Difference]: Finished difference Result 11398 states and 12294 transitions. [2020-12-23 04:18:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:53,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 687 [2020-12-23 04:18:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:53,599 INFO L225 Difference]: With dead ends: 11398 [2020-12-23 04:18:53,599 INFO L226 Difference]: Without dead ends: 6412 [2020-12-23 04:18:53,608 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2020-12-23 04:18:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6234. [2020-12-23 04:18:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2020-12-23 04:18:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6704 transitions. [2020-12-23 04:18:53,763 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6704 transitions. Word has length 687 [2020-12-23 04:18:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:53,764 INFO L481 AbstractCegarLoop]: Abstraction has 6234 states and 6704 transitions. [2020-12-23 04:18:53,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6704 transitions. [2020-12-23 04:18:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2020-12-23 04:18:53,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:53,777 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2020-12-23 04:18:53,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 04:18:53,778 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2097805772, now seen corresponding path program 1 times [2020-12-23 04:18:53,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:53,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999672172] [2020-12-23 04:18:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 1042 proven. 93 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-12-23 04:18:55,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999672172] [2020-12-23 04:18:55,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022048785] [2020-12-23 04:18:55,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:18:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:55,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:18:55,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:18:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 1135 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2020-12-23 04:18:56,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:18:56,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:18:56,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084897889] [2020-12-23 04:18:56,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:56,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:56,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:56,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:56,256 INFO L87 Difference]: Start difference. First operand 6234 states and 6704 transitions. Second operand 3 states. [2020-12-23 04:18:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:57,109 INFO L93 Difference]: Finished difference Result 13000 states and 13964 transitions. [2020-12-23 04:18:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:57,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 705 [2020-12-23 04:18:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:57,125 INFO L225 Difference]: With dead ends: 13000 [2020-12-23 04:18:57,126 INFO L226 Difference]: Without dead ends: 6946 [2020-12-23 04:18:57,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:18:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2020-12-23 04:18:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6234. [2020-12-23 04:18:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6234 states. [2020-12-23 04:18:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6704 transitions. [2020-12-23 04:18:57,241 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6704 transitions. Word has length 705 [2020-12-23 04:18:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:57,241 INFO L481 AbstractCegarLoop]: Abstraction has 6234 states and 6704 transitions. [2020-12-23 04:18:57,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6704 transitions. [2020-12-23 04:18:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2020-12-23 04:18:57,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:57,250 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:18:57,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 04:18:57,464 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1953931041, now seen corresponding path program 1 times [2020-12-23 04:18:57,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:57,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618375468] [2020-12-23 04:18:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:18:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 941 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2020-12-23 04:18:58,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618375468] [2020-12-23 04:18:58,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:18:58,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:18:58,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787881965] [2020-12-23 04:18:58,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:18:58,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:18:58,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:18:58,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:18:58,268 INFO L87 Difference]: Start difference. First operand 6234 states and 6704 transitions. Second operand 3 states. [2020-12-23 04:18:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:18:59,120 INFO L93 Difference]: Finished difference Result 12288 states and 13229 transitions. [2020-12-23 04:18:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:18:59,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2020-12-23 04:18:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:18:59,136 INFO L225 Difference]: With dead ends: 12288 [2020-12-23 04:18:59,136 INFO L226 Difference]: Without dead ends: 6234 [2020-12-23 04:18:59,144 INFO L677 BasicCegarLoop]: 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 [2020-12-23 04:18:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2020-12-23 04:18:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6056. [2020-12-23 04:18:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2020-12-23 04:18:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6462 transitions. [2020-12-23 04:18:59,249 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6462 transitions. Word has length 732 [2020-12-23 04:18:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:18:59,250 INFO L481 AbstractCegarLoop]: Abstraction has 6056 states and 6462 transitions. [2020-12-23 04:18:59,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:18:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6462 transitions. [2020-12-23 04:18:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2020-12-23 04:18:59,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:18:59,260 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2020-12-23 04:18:59,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 04:18:59,261 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:18:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:18:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1108711326, now seen corresponding path program 1 times [2020-12-23 04:18:59,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:18:59,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219170764] [2020-12-23 04:18:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:18:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 1033 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:19:00,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219170764] [2020-12-23 04:19:00,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451229735] [2020-12-23 04:19:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:00,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 04:19:00,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:01,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:01,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 04:19:01,425 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:01,754 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:02,401 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:02,999 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:03,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:19:04,000 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:04,082 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:04,226 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:04,384 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:04,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 04:19:04,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 04:19:04,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 04:19:04,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 04:19:04,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:04,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 04:19:04,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 04:19:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2049 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2020-12-23 04:19:05,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:05,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2020-12-23 04:19:05,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711471418] [2020-12-23 04:19:05,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:05,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:05,297 INFO L87 Difference]: Start difference. First operand 6056 states and 6462 transitions. Second operand 4 states. [2020-12-23 04:19:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:06,551 INFO L93 Difference]: Finished difference Result 13358 states and 14263 transitions. [2020-12-23 04:19:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:06,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 782 [2020-12-23 04:19:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:06,565 INFO L225 Difference]: With dead ends: 13358 [2020-12-23 04:19:06,566 INFO L226 Difference]: Without dead ends: 7482 [2020-12-23 04:19:06,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 781 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2020-12-23 04:19:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6590. [2020-12-23 04:19:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2020-12-23 04:19:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 7017 transitions. [2020-12-23 04:19:06,665 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 7017 transitions. Word has length 782 [2020-12-23 04:19:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:06,666 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 7017 transitions. [2020-12-23 04:19:06,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 7017 transitions. [2020-12-23 04:19:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2020-12-23 04:19:06,675 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:06,676 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:06,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:06,892 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash -697382010, now seen corresponding path program 1 times [2020-12-23 04:19:06,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:06,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780469359] [2020-12-23 04:19:06,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 1069 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:19:07,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780469359] [2020-12-23 04:19:07,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725311054] [2020-12-23 04:19:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:07,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 04:19:07,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:08,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:08,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 04:19:08,616 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:08,725 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:08,873 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:08,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:19:09,023 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:09,132 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:09,274 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2085 backedges. 782 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2020-12-23 04:19:10,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:10,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2020-12-23 04:19:10,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121373725] [2020-12-23 04:19:10,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:10,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:10,062 INFO L87 Difference]: Start difference. First operand 6590 states and 7017 transitions. Second operand 4 states. [2020-12-23 04:19:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:11,478 INFO L93 Difference]: Finished difference Result 14070 states and 14983 transitions. [2020-12-23 04:19:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:11,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 815 [2020-12-23 04:19:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:11,491 INFO L225 Difference]: With dead ends: 14070 [2020-12-23 04:19:11,492 INFO L226 Difference]: Without dead ends: 7660 [2020-12-23 04:19:11,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 814 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2020-12-23 04:19:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 6590. [2020-12-23 04:19:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2020-12-23 04:19:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 7017 transitions. [2020-12-23 04:19:11,601 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 7017 transitions. Word has length 815 [2020-12-23 04:19:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:11,602 INFO L481 AbstractCegarLoop]: Abstraction has 6590 states and 7017 transitions. [2020-12-23 04:19:11,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 7017 transitions. [2020-12-23 04:19:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2020-12-23 04:19:11,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:11,613 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:11,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:11,829 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:11,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1022736429, now seen corresponding path program 1 times [2020-12-23 04:19:11,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:11,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656875635] [2020-12-23 04:19:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 1070 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-23 04:19:12,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656875635] [2020-12-23 04:19:12,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452438457] [2020-12-23 04:19:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:12,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 04:19:12,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:13,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:19:13,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 04:19:13,563 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:13,663 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:13,905 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:14,369 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:15,086 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:15,992 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:17,310 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:18,846 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:21,031 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:23,268 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:25,960 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:29,561 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:32,520 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:36,728 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:41,221 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:47,216 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:19:54,963 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:03,635 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:13,697 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:24,264 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:35,754 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:48,172 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:01,468 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:15,643 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:29,932 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:39,849 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:43,436 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:44,593 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:45,880 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:47,357 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:49,145 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:51,297 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:53,825 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:56,477 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:58,801 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:01,097 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:03,520 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:06,266 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:09,144 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:11,981 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:15,441 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:18,288 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:21,494 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.