/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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:13:25,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:13:25,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:13:25,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:13:25,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:13:25,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:13:25,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:13:25,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:13:25,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:13:25,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:13:25,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:13:25,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:13:25,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:13:25,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:13:25,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:13:25,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:13:25,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:13:25,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:13:25,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:13:25,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:13:25,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:13:25,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:13:25,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:13:25,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:13:25,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:13:25,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:13:25,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:13:25,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:13:25,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:13:25,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:13:25,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:13:25,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:13:25,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:13:25,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:13:25,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:13:25,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:13:25,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:13:25,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:13:25,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:13:25,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:13:25,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:13:25,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 14:13:25,492 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:13:25,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:13:25,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:13:25,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:13:25,498 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:13:25,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:13:25,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:13:25,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:13:25,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:13:25,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:13:25,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:13:25,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:13:25,500 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:13:25,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:13:25,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:13:25,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:13:25,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:13:25,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:13:25,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:13:25,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:13:25,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:13:25,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:13:25,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:13:25,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:13:25,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:13:25,502 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 [2021-01-06 14:13:25,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:13:25,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:13:25,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:13:25,922 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:13:25,923 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:13:25,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2021-01-06 14:13:26,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f75fa7222/39eaf0917da04e6ba9170d8bd520e322/FLAG8a4e6c9fd [2021-01-06 14:13:26,845 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:13:26,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2021-01-06 14:13:26,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f75fa7222/39eaf0917da04e6ba9170d8bd520e322/FLAG8a4e6c9fd [2021-01-06 14:13:27,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f75fa7222/39eaf0917da04e6ba9170d8bd520e322 [2021-01-06 14:13:27,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:13:27,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:13:27,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:13:27,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:13:27,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:13:27,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:13:27" (1/1) ... [2021-01-06 14:13:27,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f62473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:27, skipping insertion in model container [2021-01-06 14:13:27,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:13:27" (1/1) ... [2021-01-06 14:13:27,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:13:27,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:13:27,494 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_label24.c[4340,4353] 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,] [2021-01-06 14:13:27,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:13:27,774 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:13:27,819 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_label24.c[4340,4353] 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,] [2021-01-06 14:13:27,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:13:28,013 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:13:28,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28 WrapperNode [2021-01-06 14:13:28,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:13:28,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:13:28,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:13:28,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:13:28,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:13:28,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:13:28,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:13:28,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:13:28,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (1/1) ... [2021-01-06 14:13:28,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:13:28,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:13:28,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:13:28,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:13:28,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (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 [2021-01-06 14:13:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:13:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:13:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:13:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:13:29,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:13:29,955 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:13:29,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:13:29 BoogieIcfgContainer [2021-01-06 14:13:29,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:13:29,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:13:29,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:13:29,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:13:29,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:13:27" (1/3) ... [2021-01-06 14:13:29,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6786595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:13:29, skipping insertion in model container [2021-01-06 14:13:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:13:28" (2/3) ... [2021-01-06 14:13:29,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6786595f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:13:29, skipping insertion in model container [2021-01-06 14:13:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:13:29" (3/3) ... [2021-01-06 14:13:29,967 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label24.c [2021-01-06 14:13:29,974 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:13:29,980 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:13:29,999 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:13:30,028 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:13:30,029 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:13:30,029 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:13:30,029 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:13:30,029 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:13:30,029 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:13:30,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:13:30,030 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:13:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:13:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 14:13:30,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:30,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:30,060 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 751578873, now seen corresponding path program 1 times [2021-01-06 14:13:30,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:30,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745516055] [2021-01-06 14:13:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:30,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745516055] [2021-01-06 14:13:30,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:30,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:13:30,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274081059] [2021-01-06 14:13:30,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:30,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:30,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:13:30,477 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2021-01-06 14:13:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:31,830 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2021-01-06 14:13:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:31,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-06 14:13:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:31,865 INFO L225 Difference]: With dead ends: 685 [2021-01-06 14:13:31,866 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 14:13:31,874 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 [2021-01-06 14:13:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 14:13:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-01-06 14:13:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-01-06 14:13:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2021-01-06 14:13:31,960 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 41 [2021-01-06 14:13:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:31,961 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2021-01-06 14:13:31,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2021-01-06 14:13:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 14:13:31,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:31,968 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, 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] [2021-01-06 14:13:31,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:13:31,968 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash -444936793, now seen corresponding path program 1 times [2021-01-06 14:13:31,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:31,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927196784] [2021-01-06 14:13:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:32,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927196784] [2021-01-06 14:13:32,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:32,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:32,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614607072] [2021-01-06 14:13:32,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:13:32,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:32,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:13:32,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:13:32,304 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2021-01-06 14:13:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:33,845 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2021-01-06 14:13:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:13:33,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 14:13:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:33,851 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:13:33,852 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:13:33,853 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 [2021-01-06 14:13:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:13:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:13:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:13:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2021-01-06 14:13:33,889 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 120 [2021-01-06 14:13:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:33,890 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2021-01-06 14:13:33,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:13:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2021-01-06 14:13:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 14:13:33,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:33,894 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:33,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:13:33,894 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2133106952, now seen corresponding path program 1 times [2021-01-06 14:13:33,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:33,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290661276] [2021-01-06 14:13:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:34,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290661276] [2021-01-06 14:13:34,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:34,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:34,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202521065] [2021-01-06 14:13:34,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:34,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:34,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:13:34,139 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand 3 states. [2021-01-06 14:13:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:35,116 INFO L93 Difference]: Finished difference Result 1074 states and 1410 transitions. [2021-01-06 14:13:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:35,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2021-01-06 14:13:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:35,131 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:13:35,132 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:13:35,133 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 [2021-01-06 14:13:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:13:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2021-01-06 14:13:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 14:13:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2021-01-06 14:13:35,196 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 146 [2021-01-06 14:13:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:35,201 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2021-01-06 14:13:35,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2021-01-06 14:13:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 14:13:35,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:35,213 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:35,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 14:13:35,214 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:35,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1339021874, now seen corresponding path program 1 times [2021-01-06 14:13:35,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:35,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270357447] [2021-01-06 14:13:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 14:13:35,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270357447] [2021-01-06 14:13:35,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:35,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:35,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863603125] [2021-01-06 14:13:35,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:13:35,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:35,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:13:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:13:35,503 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand 4 states. [2021-01-06 14:13:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:36,574 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2021-01-06 14:13:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:13:36,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2021-01-06 14:13:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:36,581 INFO L225 Difference]: With dead ends: 1993 [2021-01-06 14:13:36,581 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:13:36,583 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 [2021-01-06 14:13:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:13:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2021-01-06 14:13:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:13:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2021-01-06 14:13:36,609 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 212 [2021-01-06 14:13:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:36,609 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2021-01-06 14:13:36,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:13:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2021-01-06 14:13:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 14:13:36,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:36,613 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:36,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 14:13:36,613 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -538338920, now seen corresponding path program 1 times [2021-01-06 14:13:36,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:36,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36287839] [2021-01-06 14:13:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:37,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36287839] [2021-01-06 14:13:37,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048229105] [2021-01-06 14:13:37,041 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 [2021-01-06 14:13:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:37,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:13:37,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 14:13:37,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:37,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:13:37,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037918163] [2021-01-06 14:13:37,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:37,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:37,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:37,634 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand 3 states. [2021-01-06 14:13:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:38,491 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2021-01-06 14:13:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:38,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2021-01-06 14:13:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:38,500 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 14:13:38,500 INFO L226 Difference]: Without dead ends: 1428 [2021-01-06 14:13:38,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-01-06 14:13:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2021-01-06 14:13:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:13:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2021-01-06 14:13:38,532 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 212 [2021-01-06 14:13:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:38,534 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2021-01-06 14:13:38,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2021-01-06 14:13:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-06 14:13:38,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:38,538 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:38,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:13:38,754 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash 350300863, now seen corresponding path program 1 times [2021-01-06 14:13:38,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:38,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546828656] [2021-01-06 14:13:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 77 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:39,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546828656] [2021-01-06 14:13:39,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235947095] [2021-01-06 14:13:39,125 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 [2021-01-06 14:13:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:39,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:13:39,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 14:13:39,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:39,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:13:39,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595560862] [2021-01-06 14:13:39,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:39,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:39,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:39,485 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand 3 states. [2021-01-06 14:13:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:40,241 INFO L93 Difference]: Finished difference Result 2676 states and 3242 transitions. [2021-01-06 14:13:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:40,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2021-01-06 14:13:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:40,250 INFO L225 Difference]: With dead ends: 2676 [2021-01-06 14:13:40,250 INFO L226 Difference]: Without dead ends: 1428 [2021-01-06 14:13:40,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-01-06 14:13:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2021-01-06 14:13:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:13:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1262 transitions. [2021-01-06 14:13:40,281 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1262 transitions. Word has length 215 [2021-01-06 14:13:40,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:40,281 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1262 transitions. [2021-01-06 14:13:40,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1262 transitions. [2021-01-06 14:13:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2021-01-06 14:13:40,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:40,301 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:40,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:13:40,506 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1268562978, now seen corresponding path program 1 times [2021-01-06 14:13:40,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:40,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401717106] [2021-01-06 14:13:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:13:40,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401717106] [2021-01-06 14:13:40,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:40,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:40,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492781266] [2021-01-06 14:13:40,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:40,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:13:40,723 INFO L87 Difference]: Start difference. First operand 1072 states and 1262 transitions. Second operand 3 states. [2021-01-06 14:13:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:41,465 INFO L93 Difference]: Finished difference Result 2498 states and 2957 transitions. [2021-01-06 14:13:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:41,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2021-01-06 14:13:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:41,473 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 14:13:41,473 INFO L226 Difference]: Without dead ends: 1428 [2021-01-06 14:13:41,475 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 [2021-01-06 14:13:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-01-06 14:13:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2021-01-06 14:13:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-01-06 14:13:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1646 transitions. [2021-01-06 14:13:41,507 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1646 transitions. Word has length 216 [2021-01-06 14:13:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:41,508 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1646 transitions. [2021-01-06 14:13:41,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1646 transitions. [2021-01-06 14:13:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2021-01-06 14:13:41,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:41,516 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 14:13:41,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 14:13:41,516 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -952795878, now seen corresponding path program 1 times [2021-01-06 14:13:41,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:41,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023922242] [2021-01-06 14:13:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 195 proven. 130 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-01-06 14:13:41,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023922242] [2021-01-06 14:13:41,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671301194] [2021-01-06 14:13:41,982 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 [2021-01-06 14:13:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:42,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:13:42,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:13:42,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:42,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:13:42,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030829816] [2021-01-06 14:13:42,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:42,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:42,574 INFO L87 Difference]: Start difference. First operand 1428 states and 1646 transitions. Second operand 3 states. [2021-01-06 14:13:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:43,353 INFO L93 Difference]: Finished difference Result 3210 states and 3849 transitions. [2021-01-06 14:13:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:43,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2021-01-06 14:13:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:43,364 INFO L225 Difference]: With dead ends: 3210 [2021-01-06 14:13:43,365 INFO L226 Difference]: Without dead ends: 2140 [2021-01-06 14:13:43,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-01-06 14:13:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2021-01-06 14:13:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:13:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2462 transitions. [2021-01-06 14:13:43,413 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2462 transitions. Word has length 375 [2021-01-06 14:13:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:43,414 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2462 transitions. [2021-01-06 14:13:43,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2462 transitions. [2021-01-06 14:13:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2021-01-06 14:13:43,423 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:43,424 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 14:13:43,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:13:43,638 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:43,638 INFO L82 PathProgramCache]: Analyzing trace with hash 818186285, now seen corresponding path program 1 times [2021-01-06 14:13:43,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:43,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241882012] [2021-01-06 14:13:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2021-01-06 14:13:44,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241882012] [2021-01-06 14:13:44,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780186364] [2021-01-06 14:13:44,186 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 [2021-01-06 14:13:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:44,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:13:44,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2021-01-06 14:13:44,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:44,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-01-06 14:13:44,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734859838] [2021-01-06 14:13:44,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:44,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:13:44,783 INFO L87 Difference]: Start difference. First operand 2140 states and 2462 transitions. Second operand 3 states. [2021-01-06 14:13:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:45,595 INFO L93 Difference]: Finished difference Result 3032 states and 3462 transitions. [2021-01-06 14:13:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:45,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2021-01-06 14:13:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:45,611 INFO L225 Difference]: With dead ends: 3032 [2021-01-06 14:13:45,612 INFO L226 Difference]: Without dead ends: 3030 [2021-01-06 14:13:45,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:13:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2021-01-06 14:13:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1962. [2021-01-06 14:13:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:13:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2210 transitions. [2021-01-06 14:13:45,663 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2210 transitions. Word has length 421 [2021-01-06 14:13:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:45,664 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2210 transitions. [2021-01-06 14:13:45,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2210 transitions. [2021-01-06 14:13:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2021-01-06 14:13:45,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:45,674 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:45,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:13:45,888 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1460043639, now seen corresponding path program 1 times [2021-01-06 14:13:45,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:45,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444657528] [2021-01-06 14:13:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-01-06 14:13:46,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444657528] [2021-01-06 14:13:46,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:46,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:46,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647661931] [2021-01-06 14:13:46,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:13:46,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:46,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:13:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:13:46,356 INFO L87 Difference]: Start difference. First operand 1962 states and 2210 transitions. Second operand 4 states. [2021-01-06 14:13:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:47,208 INFO L93 Difference]: Finished difference Result 3773 states and 4271 transitions. [2021-01-06 14:13:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:13:47,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2021-01-06 14:13:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:47,221 INFO L225 Difference]: With dead ends: 3773 [2021-01-06 14:13:47,221 INFO L226 Difference]: Without dead ends: 2140 [2021-01-06 14:13:47,224 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 [2021-01-06 14:13:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-01-06 14:13:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2021-01-06 14:13:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:13:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2120 transitions. [2021-01-06 14:13:47,262 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2120 transitions. Word has length 423 [2021-01-06 14:13:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:47,263 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2120 transitions. [2021-01-06 14:13:47,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:13:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2120 transitions. [2021-01-06 14:13:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2021-01-06 14:13:47,267 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:47,267 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:47,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 14:13:47,268 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1636148394, now seen corresponding path program 1 times [2021-01-06 14:13:47,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:47,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290652283] [2021-01-06 14:13:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 409 proven. 18 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2021-01-06 14:13:48,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290652283] [2021-01-06 14:13:48,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235931508] [2021-01-06 14:13:48,271 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 [2021-01-06 14:13:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:48,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:13:48,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2021-01-06 14:13:48,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:48,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:13:48,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549925934] [2021-01-06 14:13:48,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:48,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:48,880 INFO L87 Difference]: Start difference. First operand 1962 states and 2120 transitions. Second operand 3 states. [2021-01-06 14:13:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:49,644 INFO L93 Difference]: Finished difference Result 2498 states and 2713 transitions. [2021-01-06 14:13:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:49,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2021-01-06 14:13:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:49,657 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 14:13:49,657 INFO L226 Difference]: Without dead ends: 2496 [2021-01-06 14:13:49,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2021-01-06 14:13:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2021-01-06 14:13:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2021-01-06 14:13:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2120 transitions. [2021-01-06 14:13:49,702 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2120 transitions. Word has length 449 [2021-01-06 14:13:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:49,703 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 2120 transitions. [2021-01-06 14:13:49,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2120 transitions. [2021-01-06 14:13:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2021-01-06 14:13:49,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:49,723 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:49,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-06 14:13:49,939 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash -408299685, now seen corresponding path program 1 times [2021-01-06 14:13:49,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:49,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856905896] [2021-01-06 14:13:49,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 739 proven. 11 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-01-06 14:13:51,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856905896] [2021-01-06 14:13:51,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816318425] [2021-01-06 14:13:51,197 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 [2021-01-06 14:13:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:51,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:13:51,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2021-01-06 14:13:52,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:52,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:13:52,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260433121] [2021-01-06 14:13:52,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:52,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:52,406 INFO L87 Difference]: Start difference. First operand 1962 states and 2120 transitions. Second operand 3 states. [2021-01-06 14:13:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:53,155 INFO L93 Difference]: Finished difference Result 3744 states and 4062 transitions. [2021-01-06 14:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:53,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2021-01-06 14:13:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:53,165 INFO L225 Difference]: With dead ends: 3744 [2021-01-06 14:13:53,165 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:13:53,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:13:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:13:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2021-01-06 14:13:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2021-01-06 14:13:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1888 transitions. [2021-01-06 14:13:53,204 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1888 transitions. Word has length 536 [2021-01-06 14:13:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:53,204 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 1888 transitions. [2021-01-06 14:13:53,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1888 transitions. [2021-01-06 14:13:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2021-01-06 14:13:53,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:53,211 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:53,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:13:53,412 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -672418999, now seen corresponding path program 1 times [2021-01-06 14:13:53,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:53,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327833342] [2021-01-06 14:13:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1110 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-01-06 14:13:54,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327833342] [2021-01-06 14:13:54,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:13:54,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:13:54,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429339912] [2021-01-06 14:13:54,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:13:54,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:13:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:13:54,035 INFO L87 Difference]: Start difference. First operand 1784 states and 1888 transitions. Second operand 3 states. [2021-01-06 14:13:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:54,726 INFO L93 Difference]: Finished difference Result 3744 states and 4006 transitions. [2021-01-06 14:13:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:13:54,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 610 [2021-01-06 14:13:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:54,738 INFO L225 Difference]: With dead ends: 3744 [2021-01-06 14:13:54,738 INFO L226 Difference]: Without dead ends: 2318 [2021-01-06 14:13:54,741 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 [2021-01-06 14:13:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2021-01-06 14:13:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2021-01-06 14:13:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2021-01-06 14:13:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2450 transitions. [2021-01-06 14:13:54,779 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2450 transitions. Word has length 610 [2021-01-06 14:13:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:54,780 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2450 transitions. [2021-01-06 14:13:54,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:13:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2450 transitions. [2021-01-06 14:13:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2021-01-06 14:13:54,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:54,787 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:54,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 14:13:54,788 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1265401109, now seen corresponding path program 1 times [2021-01-06 14:13:54,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:54,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514105443] [2021-01-06 14:13:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 1127 proven. 68 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-01-06 14:13:55,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514105443] [2021-01-06 14:13:55,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245400360] [2021-01-06 14:13:55,935 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 [2021-01-06 14:13:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:13:56,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:13:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 1195 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-01-06 14:13:57,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:13:57,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:13:57,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347206225] [2021-01-06 14:13:57,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:13:57,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:13:57,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:13:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:13:57,490 INFO L87 Difference]: Start difference. First operand 2318 states and 2450 transitions. Second operand 4 states. [2021-01-06 14:13:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:13:58,558 INFO L93 Difference]: Finished difference Result 4278 states and 4539 transitions. [2021-01-06 14:13:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:13:58,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 732 [2021-01-06 14:13:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:13:58,566 INFO L225 Difference]: With dead ends: 4278 [2021-01-06 14:13:58,566 INFO L226 Difference]: Without dead ends: 2318 [2021-01-06 14:13:58,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:13:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2021-01-06 14:13:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2021-01-06 14:13:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:13:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2269 transitions. [2021-01-06 14:13:58,605 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2269 transitions. Word has length 732 [2021-01-06 14:13:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:13:58,605 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2269 transitions. [2021-01-06 14:13:58,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:13:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2269 transitions. [2021-01-06 14:13:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2021-01-06 14:13:58,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:13:58,613 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:13:58,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 14:13:58,828 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:13:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:13:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash -275704914, now seen corresponding path program 1 times [2021-01-06 14:13:58,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:13:58,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221382035] [2021-01-06 14:13:58,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:13:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:13:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 1116 proven. 93 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-01-06 14:13:59,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221382035] [2021-01-06 14:13:59,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093169093] [2021-01-06 14:13:59,967 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 [2021-01-06 14:14:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:00,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:00,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 1209 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2021-01-06 14:14:01,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:01,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:01,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944259440] [2021-01-06 14:14:01,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:01,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:01,213 INFO L87 Difference]: Start difference. First operand 2140 states and 2269 transitions. Second operand 3 states. [2021-01-06 14:14:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:01,951 INFO L93 Difference]: Finished difference Result 4100 states and 4357 transitions. [2021-01-06 14:14:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:01,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 739 [2021-01-06 14:14:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:01,960 INFO L225 Difference]: With dead ends: 4100 [2021-01-06 14:14:01,960 INFO L226 Difference]: Without dead ends: 2140 [2021-01-06 14:14:01,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-01-06 14:14:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2021-01-06 14:14:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:14:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2256 transitions. [2021-01-06 14:14:01,996 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2256 transitions. Word has length 739 [2021-01-06 14:14:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:01,997 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2256 transitions. [2021-01-06 14:14:01,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2256 transitions. [2021-01-06 14:14:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2021-01-06 14:14:02,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:02,005 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:02,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:14:02,219 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 952415469, now seen corresponding path program 1 times [2021-01-06 14:14:02,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:02,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258046049] [2021-01-06 14:14:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-01-06 14:14:03,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258046049] [2021-01-06 14:14:03,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705545186] [2021-01-06 14:14:03,071 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:03,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:03,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2021-01-06 14:14:04,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:14:04,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:14:04,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547205487] [2021-01-06 14:14:04,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:04,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:04,343 INFO L87 Difference]: Start difference. First operand 2140 states and 2256 transitions. Second operand 4 states. [2021-01-06 14:14:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:05,358 INFO L93 Difference]: Finished difference Result 4812 states and 5112 transitions. [2021-01-06 14:14:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:05,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 765 [2021-01-06 14:14:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:05,397 INFO L225 Difference]: With dead ends: 4812 [2021-01-06 14:14:05,397 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 14:14:05,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 14:14:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-01-06 14:14:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:14:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3022 transitions. [2021-01-06 14:14:05,477 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3022 transitions. Word has length 765 [2021-01-06 14:14:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:05,478 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3022 transitions. [2021-01-06 14:14:05,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3022 transitions. [2021-01-06 14:14:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2021-01-06 14:14:05,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:05,489 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:05,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 14:14:05,703 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1384123154, now seen corresponding path program 1 times [2021-01-06 14:14:05,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204509321] [2021-01-06 14:14:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 1380 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2021-01-06 14:14:06,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204509321] [2021-01-06 14:14:06,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:06,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:06,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418692953] [2021-01-06 14:14:06,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:06,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:06,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:06,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:06,573 INFO L87 Difference]: Start difference. First operand 2852 states and 3022 transitions. Second operand 3 states. [2021-01-06 14:14:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:07,292 INFO L93 Difference]: Finished difference Result 6592 states and 7010 transitions. [2021-01-06 14:14:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:07,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 837 [2021-01-06 14:14:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:07,303 INFO L225 Difference]: With dead ends: 6592 [2021-01-06 14:14:07,303 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:07,307 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 [2021-01-06 14:14:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:14:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2021-01-06 14:14:07,368 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 837 [2021-01-06 14:14:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:07,369 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2021-01-06 14:14:07,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2021-01-06 14:14:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2021-01-06 14:14:07,379 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:07,379 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, 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, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:07,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 14:14:07,380 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:07,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1474782911, now seen corresponding path program 1 times [2021-01-06 14:14:07,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:07,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311235372] [2021-01-06 14:14:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 1447 proven. 93 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-01-06 14:14:08,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311235372] [2021-01-06 14:14:08,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076466265] [2021-01-06 14:14:08,778 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:09,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:09,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 1540 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2021-01-06 14:14:10,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:10,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:10,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174820629] [2021-01-06 14:14:10,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:10,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:10,173 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 3 states. [2021-01-06 14:14:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:10,902 INFO L93 Difference]: Finished difference Result 7660 states and 8081 transitions. [2021-01-06 14:14:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:10,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 855 [2021-01-06 14:14:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:10,913 INFO L225 Difference]: With dead ends: 7660 [2021-01-06 14:14:10,914 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:14:10,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:14:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2021-01-06 14:14:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2021-01-06 14:14:10,977 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 855 [2021-01-06 14:14:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:10,978 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2021-01-06 14:14:10,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2021-01-06 14:14:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2021-01-06 14:14:10,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:10,990 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:11,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 14:14:11,204 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:11,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1020167818, now seen corresponding path program 1 times [2021-01-06 14:14:11,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:11,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515212859] [2021-01-06 14:14:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 1656 proven. 260 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2021-01-06 14:14:12,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515212859] [2021-01-06 14:14:12,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906680074] [2021-01-06 14:14:12,582 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:12,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:12,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 1602 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2021-01-06 14:14:14,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:14,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:14:14,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118515401] [2021-01-06 14:14:14,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:14,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:14,177 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 4 states. [2021-01-06 14:14:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:15,228 INFO L93 Difference]: Finished difference Result 7482 states and 7899 transitions. [2021-01-06 14:14:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:15,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 894 [2021-01-06 14:14:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:15,237 INFO L225 Difference]: With dead ends: 7482 [2021-01-06 14:14:15,237 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:15,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 892 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:14:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3946 transitions. [2021-01-06 14:14:15,292 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3946 transitions. Word has length 894 [2021-01-06 14:14:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:15,293 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3946 transitions. [2021-01-06 14:14:15,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3946 transitions. [2021-01-06 14:14:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-01-06 14:14:15,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:15,304 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, 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, 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, 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, 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] [2021-01-06 14:14:15,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:15,518 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1744731529, now seen corresponding path program 1 times [2021-01-06 14:14:15,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:15,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182285697] [2021-01-06 14:14:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 1657 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2021-01-06 14:14:16,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182285697] [2021-01-06 14:14:16,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:16,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:16,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437425091] [2021-01-06 14:14:16,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:16,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:16,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:16,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:16,395 INFO L87 Difference]: Start difference. First operand 3742 states and 3946 transitions. Second operand 3 states. [2021-01-06 14:14:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:17,140 INFO L93 Difference]: Finished difference Result 7482 states and 7924 transitions. [2021-01-06 14:14:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:17,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 923 [2021-01-06 14:14:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:17,148 INFO L225 Difference]: With dead ends: 7482 [2021-01-06 14:14:17,148 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:17,152 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 [2021-01-06 14:14:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2021-01-06 14:14:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2021-01-06 14:14:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4122 transitions. [2021-01-06 14:14:17,205 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4122 transitions. Word has length 923 [2021-01-06 14:14:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:17,205 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4122 transitions. [2021-01-06 14:14:17,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4122 transitions. [2021-01-06 14:14:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2021-01-06 14:14:17,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:17,220 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 2, 2, 2, 2, 2, 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] [2021-01-06 14:14:17,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:14:17,220 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 208712432, now seen corresponding path program 1 times [2021-01-06 14:14:17,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:17,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224081181] [2021-01-06 14:14:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3378 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2021-01-06 14:14:18,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224081181] [2021-01-06 14:14:18,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:18,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:18,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443532094] [2021-01-06 14:14:18,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:18,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:18,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:18,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:18,169 INFO L87 Difference]: Start difference. First operand 3920 states and 4122 transitions. Second operand 3 states. [2021-01-06 14:14:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:18,933 INFO L93 Difference]: Finished difference Result 8016 states and 8472 transitions. [2021-01-06 14:14:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:18,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1007 [2021-01-06 14:14:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:18,943 INFO L225 Difference]: With dead ends: 8016 [2021-01-06 14:14:18,944 INFO L226 Difference]: Without dead ends: 4276 [2021-01-06 14:14:18,948 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 [2021-01-06 14:14:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-01-06 14:14:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2021-01-06 14:14:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:14:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4485 transitions. [2021-01-06 14:14:19,013 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4485 transitions. Word has length 1007 [2021-01-06 14:14:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:19,015 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4485 transitions. [2021-01-06 14:14:19,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4485 transitions. [2021-01-06 14:14:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2021-01-06 14:14:19,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:19,030 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:19,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 14:14:19,030 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1824429464, now seen corresponding path program 1 times [2021-01-06 14:14:19,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:19,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565031687] [2021-01-06 14:14:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2520 proven. 72 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2021-01-06 14:14:20,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565031687] [2021-01-06 14:14:20,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280488624] [2021-01-06 14:14:20,368 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:20,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:14:20,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2233 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2021-01-06 14:14:22,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:22,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-01-06 14:14:22,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107478604] [2021-01-06 14:14:22,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:22,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:22,467 INFO L87 Difference]: Start difference. First operand 4276 states and 4485 transitions. Second operand 4 states. [2021-01-06 14:14:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:23,643 INFO L93 Difference]: Finished difference Result 9262 states and 9721 transitions. [2021-01-06 14:14:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:23,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1055 [2021-01-06 14:14:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:23,657 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:14:23,658 INFO L226 Difference]: Without dead ends: 5166 [2021-01-06 14:14:23,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 1054 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2021-01-06 14:14:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2021-01-06 14:14:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:14:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5036 transitions. [2021-01-06 14:14:23,733 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5036 transitions. Word has length 1055 [2021-01-06 14:14:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:23,734 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5036 transitions. [2021-01-06 14:14:23,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5036 transitions. [2021-01-06 14:14:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2021-01-06 14:14:23,748 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:23,748 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2021-01-06 14:14:23,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:23,962 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -434653060, now seen corresponding path program 1 times [2021-01-06 14:14:23,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:23,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173374559] [2021-01-06 14:14:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 1991 proven. 0 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2021-01-06 14:14:25,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173374559] [2021-01-06 14:14:25,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:25,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:25,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802156295] [2021-01-06 14:14:25,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:25,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:25,282 INFO L87 Difference]: Start difference. First operand 4810 states and 5036 transitions. Second operand 3 states. [2021-01-06 14:14:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:25,992 INFO L93 Difference]: Finished difference Result 9796 states and 10250 transitions. [2021-01-06 14:14:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:25,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1057 [2021-01-06 14:14:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:26,002 INFO L225 Difference]: With dead ends: 9796 [2021-01-06 14:14:26,003 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:14:26,008 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 [2021-01-06 14:14:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:14:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2021-01-06 14:14:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:14:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4827 transitions. [2021-01-06 14:14:26,072 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4827 transitions. Word has length 1057 [2021-01-06 14:14:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:26,073 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4827 transitions. [2021-01-06 14:14:26,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4827 transitions. [2021-01-06 14:14:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2021-01-06 14:14:26,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:26,088 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:26,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 14:14:26,088 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1898270108, now seen corresponding path program 1 times [2021-01-06 14:14:26,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:26,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542893532] [2021-01-06 14:14:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 2594 proven. 325 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2021-01-06 14:14:27,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542893532] [2021-01-06 14:14:27,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070982104] [2021-01-06 14:14:27,878 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:28,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:28,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3853 backedges. 2529 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2021-01-06 14:14:30,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:30,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:14:30,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158733960] [2021-01-06 14:14:30,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:30,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:30,044 INFO L87 Difference]: Start difference. First operand 4632 states and 4827 transitions. Second operand 4 states. [2021-01-06 14:14:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:31,142 INFO L93 Difference]: Finished difference Result 9262 states and 9653 transitions. [2021-01-06 14:14:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:31,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1112 [2021-01-06 14:14:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:31,148 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:14:31,148 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:14:31,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:14:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2021-01-06 14:14:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:14:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4825 transitions. [2021-01-06 14:14:31,209 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4825 transitions. Word has length 1112 [2021-01-06 14:14:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:31,210 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4825 transitions. [2021-01-06 14:14:31,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4825 transitions. [2021-01-06 14:14:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2021-01-06 14:14:31,232 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:31,233 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:31,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 14:14:31,447 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2013578177, now seen corresponding path program 1 times [2021-01-06 14:14:31,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:31,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75745695] [2021-01-06 14:14:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3911 backedges. 2587 proven. 0 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2021-01-06 14:14:32,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75745695] [2021-01-06 14:14:32,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:32,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:32,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903941282] [2021-01-06 14:14:32,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:32,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:32,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:32,782 INFO L87 Difference]: Start difference. First operand 4632 states and 4825 transitions. Second operand 3 states. [2021-01-06 14:14:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:33,513 INFO L93 Difference]: Finished difference Result 9262 states and 9649 transitions. [2021-01-06 14:14:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:33,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1141 [2021-01-06 14:14:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:33,518 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:14:33,518 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:14:33,522 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 [2021-01-06 14:14:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:14:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2021-01-06 14:14:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:14:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4993 transitions. [2021-01-06 14:14:33,581 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4993 transitions. Word has length 1141 [2021-01-06 14:14:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:33,582 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4993 transitions. [2021-01-06 14:14:33,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4993 transitions. [2021-01-06 14:14:33,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2021-01-06 14:14:33,601 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:33,602 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 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] [2021-01-06 14:14:33,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 14:14:33,603 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1966731662, now seen corresponding path program 1 times [2021-01-06 14:14:33,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:33,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357513774] [2021-01-06 14:14:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4280 backedges. 2381 proven. 0 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2021-01-06 14:14:34,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357513774] [2021-01-06 14:14:34,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:34,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:34,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938669964] [2021-01-06 14:14:34,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:34,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:34,848 INFO L87 Difference]: Start difference. First operand 4810 states and 4993 transitions. Second operand 3 states. [2021-01-06 14:14:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:35,617 INFO L93 Difference]: Finished difference Result 9440 states and 9805 transitions. [2021-01-06 14:14:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:35,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1215 [2021-01-06 14:14:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:35,623 INFO L225 Difference]: With dead ends: 9440 [2021-01-06 14:14:35,623 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:14:35,627 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 [2021-01-06 14:14:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:14:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2021-01-06 14:14:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:14:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4775 transitions. [2021-01-06 14:14:35,700 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4775 transitions. Word has length 1215 [2021-01-06 14:14:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:35,701 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4775 transitions. [2021-01-06 14:14:35,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4775 transitions. [2021-01-06 14:14:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2021-01-06 14:14:35,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:35,721 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:35,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 14:14:35,721 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1697277830, now seen corresponding path program 1 times [2021-01-06 14:14:35,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:35,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401710212] [2021-01-06 14:14:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 3472 proven. 0 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2021-01-06 14:14:37,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401710212] [2021-01-06 14:14:37,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:37,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:14:37,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833626104] [2021-01-06 14:14:37,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:37,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:37,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:37,331 INFO L87 Difference]: Start difference. First operand 4632 states and 4775 transitions. Second operand 4 states. [2021-01-06 14:14:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:38,669 INFO L93 Difference]: Finished difference Result 9084 states and 9369 transitions. [2021-01-06 14:14:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:38,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1295 [2021-01-06 14:14:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:38,674 INFO L225 Difference]: With dead ends: 9084 [2021-01-06 14:14:38,674 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:14:38,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:14:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:14:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:14:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4748 transitions. [2021-01-06 14:14:38,720 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4748 transitions. Word has length 1295 [2021-01-06 14:14:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:38,721 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4748 transitions. [2021-01-06 14:14:38,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4748 transitions. [2021-01-06 14:14:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2021-01-06 14:14:38,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:38,741 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:38,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 14:14:38,741 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1326804845, now seen corresponding path program 1 times [2021-01-06 14:14:38,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:38,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100349663] [2021-01-06 14:14:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 2663 proven. 78 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2021-01-06 14:14:40,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100349663] [2021-01-06 14:14:40,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312779905] [2021-01-06 14:14:40,856 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:41,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 1783 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 14:14:41,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:42,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 14:14:42,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:14:42,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 14:14:42,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:14:42,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:14:42,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 14:14:42,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 14:14:42,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 14:14:42,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 14:14:42,909 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:43,087 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:43,298 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:43,553 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:43,870 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:44,971 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:46,452 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:48,293 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:49,996 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:52,116 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:54,772 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:56,831 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:58,052 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:58,746 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:14:59,577 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:00,532 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:01,777 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:03,149 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:04,670 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:06,120 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:07,568 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:09,172 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:10,878 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:12,683 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:14,761 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:17,250 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:19,744 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:22,445 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:25,217 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:28,011 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:31,037 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:34,253 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:37,673 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:41,541 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:45,619 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:50,023 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:54,674 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:00,052 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:05,144 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:10,268 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:15,462 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:20,757 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:26,716 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:33,040 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:39,340 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:46,344 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:54,855 INFO L757 QuantifierPusher]: Run 470 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:04,324 INFO L757 QuantifierPusher]: Run 480 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:14,371 INFO L757 QuantifierPusher]: Run 490 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:22,452 INFO L757 QuantifierPusher]: Run 500 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.