/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/Problem11_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:37:48,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:37:48,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:37:48,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:37:48,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:37:48,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:37:48,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:37:48,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:37:48,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:37:48,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:37:48,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:37:48,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:37:48,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:37:48,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:37:48,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:37:48,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:37:48,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:37:48,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:37:48,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:37:48,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:37:48,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:37:48,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:37:48,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:37:48,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:37:48,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:37:48,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:37:48,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:37:48,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:37:48,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:37:48,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:37:48,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:37:48,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:37:48,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:37:48,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:37:48,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:37:48,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:37:48,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:37:48,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:37:48,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:37:48,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:37:48,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:37:48,530 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 13:37:48,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:37:48,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:37:48,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:37:48,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:37:48,558 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:37:48,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:37:48,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:37:48,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:37:48,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:37:48,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:37:48,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:37:48,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:37:48,561 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:37:48,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:37:48,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:37:48,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:37:48,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:37:48,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:37:48,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:37:48,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:37:48,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:37:48,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:37:48,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:37:48,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:37:48,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:37:48,564 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 13:37:48,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:37:48,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:37:48,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:37:48,973 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:37:48,977 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:37:48,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2021-01-06 13:37:49,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c82e28958/f6da043807f44fcd881d9a6f1e0189b0/FLAG5eeb2a15f [2021-01-06 13:37:50,033 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:37:50,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2021-01-06 13:37:50,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c82e28958/f6da043807f44fcd881d9a6f1e0189b0/FLAG5eeb2a15f [2021-01-06 13:37:50,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c82e28958/f6da043807f44fcd881d9a6f1e0189b0 [2021-01-06 13:37:50,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:37:50,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:37:50,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:37:50,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:37:50,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:37:50,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:37:50" (1/1) ... [2021-01-06 13:37:50,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd2bf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:50, skipping insertion in model container [2021-01-06 13:37:50,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:37:50" (1/1) ... [2021-01-06 13:37:50,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:37:50,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:37:50,590 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/Problem11_label48.c[7294,7307] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~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 13:37:51,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:37:51,026 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:37:51,056 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/Problem11_label48.c[7294,7307] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~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 13:37:51,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:37:51,264 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:37:51,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51 WrapperNode [2021-01-06 13:37:51,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:37:51,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:37:51,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:37:51,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:37:51,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:37:51,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:37:51,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:37:51,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:37:51,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (1/1) ... [2021-01-06 13:37:51,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:37:51,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:37:51,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:37:51,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:37:51,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (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 13:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:37:51,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:37:53,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:37:53,922 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:37:53,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:37:53 BoogieIcfgContainer [2021-01-06 13:37:53,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:37:53,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:37:53,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:37:53,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:37:53,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:37:50" (1/3) ... [2021-01-06 13:37:53,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5968ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:37:53, skipping insertion in model container [2021-01-06 13:37:53,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:51" (2/3) ... [2021-01-06 13:37:53,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5968ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:37:53, skipping insertion in model container [2021-01-06 13:37:53,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:37:53" (3/3) ... [2021-01-06 13:37:53,936 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2021-01-06 13:37:53,943 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:37:53,950 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:37:53,973 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:37:54,004 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:37:54,005 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:37:54,005 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:37:54,005 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:37:54,005 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:37:54,005 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:37:54,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:37:54,006 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:37:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2021-01-06 13:37:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 13:37:54,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:54,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:54,044 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash 761214138, now seen corresponding path program 1 times [2021-01-06 13:37:54,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:54,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037394074] [2021-01-06 13:37:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:54,414 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 13:37:54,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037394074] [2021-01-06 13:37:54,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:54,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:54,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003997885] [2021-01-06 13:37:54,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:54,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:54,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:54,445 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2021-01-06 13:37:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:55,936 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2021-01-06 13:37:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:55,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-01-06 13:37:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:55,957 INFO L225 Difference]: With dead ends: 761 [2021-01-06 13:37:55,957 INFO L226 Difference]: Without dead ends: 413 [2021-01-06 13:37:55,963 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 13:37:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-01-06 13:37:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-01-06 13:37:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2021-01-06 13:37:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2021-01-06 13:37:56,042 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 50 [2021-01-06 13:37:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:56,043 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2021-01-06 13:37:56,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2021-01-06 13:37:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 13:37:56,049 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:56,049 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, 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] [2021-01-06 13:37:56,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:37:56,050 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2108563154, now seen corresponding path program 1 times [2021-01-06 13:37:56,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:56,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855386878] [2021-01-06 13:37:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:56,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855386878] [2021-01-06 13:37:56,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:56,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:56,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810985097] [2021-01-06 13:37:56,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:56,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:56,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:56,310 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 3 states. [2021-01-06 13:37:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:57,736 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2021-01-06 13:37:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:57,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-06 13:37:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:57,744 INFO L225 Difference]: With dead ends: 1211 [2021-01-06 13:37:57,745 INFO L226 Difference]: Without dead ends: 800 [2021-01-06 13:37:57,748 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 13:37:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-01-06 13:37:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2021-01-06 13:37:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2021-01-06 13:37:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2021-01-06 13:37:57,837 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 118 [2021-01-06 13:37:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:57,837 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2021-01-06 13:37:57,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2021-01-06 13:37:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 13:37:57,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:57,842 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, 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] [2021-01-06 13:37:57,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:37:57,842 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -66853459, now seen corresponding path program 1 times [2021-01-06 13:37:57,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:57,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913406374] [2021-01-06 13:37:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:58,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913406374] [2021-01-06 13:37:58,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:58,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:58,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683970399] [2021-01-06 13:37:58,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:58,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:58,117 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand 3 states. [2021-01-06 13:37:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:59,389 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2021-01-06 13:37:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:59,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 13:37:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:59,402 INFO L225 Difference]: With dead ends: 2314 [2021-01-06 13:37:59,402 INFO L226 Difference]: Without dead ends: 1527 [2021-01-06 13:37:59,405 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 13:37:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-01-06 13:37:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2021-01-06 13:37:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2021-01-06 13:37:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2021-01-06 13:37:59,480 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 120 [2021-01-06 13:37:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:59,490 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2021-01-06 13:37:59,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2021-01-06 13:37:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-06 13:37:59,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:59,500 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:59,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:37:59,502 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1662993007, now seen corresponding path program 1 times [2021-01-06 13:37:59,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:59,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064074955] [2021-01-06 13:37:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:59,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064074955] [2021-01-06 13:37:59,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:59,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:37:59,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612709678] [2021-01-06 13:37:59,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:59,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:59,786 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand 3 states. [2021-01-06 13:38:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:01,045 INFO L93 Difference]: Finished difference Result 3614 states and 4469 transitions. [2021-01-06 13:38:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:01,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2021-01-06 13:38:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:01,060 INFO L225 Difference]: With dead ends: 3614 [2021-01-06 13:38:01,060 INFO L226 Difference]: Without dead ends: 2274 [2021-01-06 13:38:01,063 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 13:38:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2021-01-06 13:38:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1897. [2021-01-06 13:38:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2021-01-06 13:38:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2305 transitions. [2021-01-06 13:38:01,120 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2305 transitions. Word has length 177 [2021-01-06 13:38:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:01,122 INFO L481 AbstractCegarLoop]: Abstraction has 1897 states and 2305 transitions. [2021-01-06 13:38:01,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2305 transitions. [2021-01-06 13:38:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-06 13:38:01,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:01,128 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:01,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:38:01,129 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1101521033, now seen corresponding path program 1 times [2021-01-06 13:38:01,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:01,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183528259] [2021-01-06 13:38:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:38:01,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183528259] [2021-01-06 13:38:01,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:01,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:01,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961590339] [2021-01-06 13:38:01,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:01,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:01,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:01,488 INFO L87 Difference]: Start difference. First operand 1897 states and 2305 transitions. Second operand 3 states. [2021-01-06 13:38:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:02,920 INFO L93 Difference]: Finished difference Result 4351 states and 5354 transitions. [2021-01-06 13:38:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2021-01-06 13:38:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:02,935 INFO L225 Difference]: With dead ends: 4351 [2021-01-06 13:38:02,935 INFO L226 Difference]: Without dead ends: 2456 [2021-01-06 13:38:02,939 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 13:38:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2021-01-06 13:38:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2265. [2021-01-06 13:38:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2021-01-06 13:38:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2751 transitions. [2021-01-06 13:38:03,000 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2751 transitions. Word has length 232 [2021-01-06 13:38:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:03,001 INFO L481 AbstractCegarLoop]: Abstraction has 2265 states and 2751 transitions. [2021-01-06 13:38:03,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2751 transitions. [2021-01-06 13:38:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-01-06 13:38:03,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:03,008 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:03,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:38:03,008 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash 697992722, now seen corresponding path program 1 times [2021-01-06 13:38:03,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:03,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806615616] [2021-01-06 13:38:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:03,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806615616] [2021-01-06 13:38:03,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:03,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:03,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022616698] [2021-01-06 13:38:03,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:03,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:03,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:03,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:03,305 INFO L87 Difference]: Start difference. First operand 2265 states and 2751 transitions. Second operand 3 states. [2021-01-06 13:38:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:04,743 INFO L93 Difference]: Finished difference Result 6017 states and 7428 transitions. [2021-01-06 13:38:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:04,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2021-01-06 13:38:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:04,764 INFO L225 Difference]: With dead ends: 6017 [2021-01-06 13:38:04,764 INFO L226 Difference]: Without dead ends: 3754 [2021-01-06 13:38:04,768 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 13:38:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2021-01-06 13:38:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3750. [2021-01-06 13:38:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3750 states. [2021-01-06 13:38:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4542 transitions. [2021-01-06 13:38:04,853 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4542 transitions. Word has length 259 [2021-01-06 13:38:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:04,853 INFO L481 AbstractCegarLoop]: Abstraction has 3750 states and 4542 transitions. [2021-01-06 13:38:04,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4542 transitions. [2021-01-06 13:38:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-01-06 13:38:04,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:04,860 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:04,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:38:04,861 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash 448170155, now seen corresponding path program 1 times [2021-01-06 13:38:04,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:04,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316893525] [2021-01-06 13:38:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:05,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316893525] [2021-01-06 13:38:05,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:05,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:38:05,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341680819] [2021-01-06 13:38:05,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 13:38:05,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 13:38:05,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:38:05,266 INFO L87 Difference]: Start difference. First operand 3750 states and 4542 transitions. Second operand 5 states. [2021-01-06 13:38:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:08,575 INFO L93 Difference]: Finished difference Result 12303 states and 15293 transitions. [2021-01-06 13:38:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 13:38:08,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2021-01-06 13:38:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:08,624 INFO L225 Difference]: With dead ends: 12303 [2021-01-06 13:38:08,624 INFO L226 Difference]: Without dead ends: 8555 [2021-01-06 13:38:08,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:38:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8555 states. [2021-01-06 13:38:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8555 to 8358. [2021-01-06 13:38:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8358 states. [2021-01-06 13:38:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 10067 transitions. [2021-01-06 13:38:08,824 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 10067 transitions. Word has length 269 [2021-01-06 13:38:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:08,825 INFO L481 AbstractCegarLoop]: Abstraction has 8358 states and 10067 transitions. [2021-01-06 13:38:08,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 13:38:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 10067 transitions. [2021-01-06 13:38:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2021-01-06 13:38:08,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:08,834 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 13:38:08,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:38:08,835 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash 510762410, now seen corresponding path program 1 times [2021-01-06 13:38:08,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:08,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771579920] [2021-01-06 13:38:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 13:38:09,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771579920] [2021-01-06 13:38:09,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:09,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:09,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022086572] [2021-01-06 13:38:09,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:09,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:09,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:09,101 INFO L87 Difference]: Start difference. First operand 8358 states and 10067 transitions. Second operand 3 states. [2021-01-06 13:38:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:10,543 INFO L93 Difference]: Finished difference Result 19472 states and 23738 transitions. [2021-01-06 13:38:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:10,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2021-01-06 13:38:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:10,601 INFO L225 Difference]: With dead ends: 19472 [2021-01-06 13:38:10,601 INFO L226 Difference]: Without dead ends: 11484 [2021-01-06 13:38:10,615 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 13:38:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11484 states. [2021-01-06 13:38:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11484 to 11300. [2021-01-06 13:38:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11300 states. [2021-01-06 13:38:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11300 states to 11300 states and 13516 transitions. [2021-01-06 13:38:10,852 INFO L78 Accepts]: Start accepts. Automaton has 11300 states and 13516 transitions. Word has length 280 [2021-01-06 13:38:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:10,853 INFO L481 AbstractCegarLoop]: Abstraction has 11300 states and 13516 transitions. [2021-01-06 13:38:10,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 11300 states and 13516 transitions. [2021-01-06 13:38:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-01-06 13:38:10,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:10,862 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 13:38:10,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:38:10,862 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 577294273, now seen corresponding path program 1 times [2021-01-06 13:38:10,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:10,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933062550] [2021-01-06 13:38:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 95 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:11,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933062550] [2021-01-06 13:38:11,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647311315] [2021-01-06 13:38:11,334 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 13:38:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:11,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:38:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:12,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:12,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:12,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971183319] [2021-01-06 13:38:12,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:12,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:12,249 INFO L87 Difference]: Start difference. First operand 11300 states and 13516 transitions. Second operand 3 states. [2021-01-06 13:38:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:13,488 INFO L93 Difference]: Finished difference Result 23163 states and 27721 transitions. [2021-01-06 13:38:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:13,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2021-01-06 13:38:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:13,527 INFO L225 Difference]: With dead ends: 23163 [2021-01-06 13:38:13,527 INFO L226 Difference]: Without dead ends: 12233 [2021-01-06 13:38:13,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2021-01-06 13:38:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 12226. [2021-01-06 13:38:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12226 states. [2021-01-06 13:38:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12226 states to 12226 states and 14553 transitions. [2021-01-06 13:38:13,741 INFO L78 Accepts]: Start accepts. Automaton has 12226 states and 14553 transitions. Word has length 283 [2021-01-06 13:38:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:13,742 INFO L481 AbstractCegarLoop]: Abstraction has 12226 states and 14553 transitions. [2021-01-06 13:38:13,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12226 states and 14553 transitions. [2021-01-06 13:38:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2021-01-06 13:38:13,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:13,752 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 13:38:13,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-06 13:38:13,968 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1277495970, now seen corresponding path program 1 times [2021-01-06 13:38:13,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:13,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766233101] [2021-01-06 13:38:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:14,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766233101] [2021-01-06 13:38:14,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:14,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:38:14,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664873668] [2021-01-06 13:38:14,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:38:14,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:38:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:38:14,261 INFO L87 Difference]: Start difference. First operand 12226 states and 14553 transitions. Second operand 4 states. [2021-01-06 13:38:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:16,726 INFO L93 Difference]: Finished difference Result 27222 states and 32648 transitions. [2021-01-06 13:38:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:16,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2021-01-06 13:38:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:16,762 INFO L225 Difference]: With dead ends: 27222 [2021-01-06 13:38:16,762 INFO L226 Difference]: Without dead ends: 15366 [2021-01-06 13:38:16,780 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 13:38:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2021-01-06 13:38:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 15359. [2021-01-06 13:38:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15359 states. [2021-01-06 13:38:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15359 states to 15359 states and 18167 transitions. [2021-01-06 13:38:17,153 INFO L78 Accepts]: Start accepts. Automaton has 15359 states and 18167 transitions. Word has length 286 [2021-01-06 13:38:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:17,154 INFO L481 AbstractCegarLoop]: Abstraction has 15359 states and 18167 transitions. [2021-01-06 13:38:17,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 15359 states and 18167 transitions. [2021-01-06 13:38:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-01-06 13:38:17,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:17,168 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, 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, 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] [2021-01-06 13:38:17,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:38:17,168 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1155216390, now seen corresponding path program 1 times [2021-01-06 13:38:17,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:17,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719663950] [2021-01-06 13:38:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-01-06 13:38:17,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719663950] [2021-01-06 13:38:17,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:17,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:17,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918184470] [2021-01-06 13:38:17,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:17,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:17,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:17,513 INFO L87 Difference]: Start difference. First operand 15359 states and 18167 transitions. Second operand 3 states. [2021-01-06 13:38:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:18,828 INFO L93 Difference]: Finished difference Result 29605 states and 35118 transitions. [2021-01-06 13:38:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2021-01-06 13:38:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:18,863 INFO L225 Difference]: With dead ends: 29605 [2021-01-06 13:38:18,863 INFO L226 Difference]: Without dead ends: 14616 [2021-01-06 13:38:18,882 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 13:38:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14616 states. [2021-01-06 13:38:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14616 to 14430. [2021-01-06 13:38:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14430 states. [2021-01-06 13:38:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14430 states to 14430 states and 16263 transitions. [2021-01-06 13:38:19,165 INFO L78 Accepts]: Start accepts. Automaton has 14430 states and 16263 transitions. Word has length 308 [2021-01-06 13:38:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:19,166 INFO L481 AbstractCegarLoop]: Abstraction has 14430 states and 16263 transitions. [2021-01-06 13:38:19,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14430 states and 16263 transitions. [2021-01-06 13:38:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2021-01-06 13:38:19,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:19,179 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:19,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 13:38:19,180 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 100748151, now seen corresponding path program 1 times [2021-01-06 13:38:19,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:19,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50330480] [2021-01-06 13:38:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 13:38:19,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50330480] [2021-01-06 13:38:19,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:19,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:19,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599601636] [2021-01-06 13:38:19,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:19,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:19,437 INFO L87 Difference]: Start difference. First operand 14430 states and 16263 transitions. Second operand 3 states. [2021-01-06 13:38:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:20,942 INFO L93 Difference]: Finished difference Result 31249 states and 35343 transitions. [2021-01-06 13:38:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:20,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2021-01-06 13:38:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:20,997 INFO L225 Difference]: With dead ends: 31249 [2021-01-06 13:38:20,998 INFO L226 Difference]: Without dead ends: 17005 [2021-01-06 13:38:21,012 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 13:38:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17005 states. [2021-01-06 13:38:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17005 to 15340. [2021-01-06 13:38:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15340 states. [2021-01-06 13:38:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 17207 transitions. [2021-01-06 13:38:21,364 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 17207 transitions. Word has length 312 [2021-01-06 13:38:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:21,365 INFO L481 AbstractCegarLoop]: Abstraction has 15340 states and 17207 transitions. [2021-01-06 13:38:21,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 17207 transitions. [2021-01-06 13:38:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-01-06 13:38:21,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:21,382 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 13:38:21,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:38:21,382 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1462001354, now seen corresponding path program 1 times [2021-01-06 13:38:21,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:21,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180941766] [2021-01-06 13:38:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 221 proven. 72 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-01-06 13:38:22,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180941766] [2021-01-06 13:38:22,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307454825] [2021-01-06 13:38:22,246 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 13:38:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:22,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:38:22,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 13:38:22,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:22,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:22,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079684494] [2021-01-06 13:38:22,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:22,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:22,882 INFO L87 Difference]: Start difference. First operand 15340 states and 17207 transitions. Second operand 3 states. [2021-01-06 13:38:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:24,134 INFO L93 Difference]: Finished difference Result 32708 states and 36679 transitions. [2021-01-06 13:38:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:24,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2021-01-06 13:38:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:24,165 INFO L225 Difference]: With dead ends: 32708 [2021-01-06 13:38:24,165 INFO L226 Difference]: Without dead ends: 17554 [2021-01-06 13:38:24,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 337 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 13:38:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2021-01-06 13:38:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 16816. [2021-01-06 13:38:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16816 states. [2021-01-06 13:38:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16816 states to 16816 states and 18767 transitions. [2021-01-06 13:38:24,530 INFO L78 Accepts]: Start accepts. Automaton has 16816 states and 18767 transitions. Word has length 337 [2021-01-06 13:38:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:24,531 INFO L481 AbstractCegarLoop]: Abstraction has 16816 states and 18767 transitions. [2021-01-06 13:38:24,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16816 states and 18767 transitions. [2021-01-06 13:38:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2021-01-06 13:38:24,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:24,545 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:38:24,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 13:38:24,760 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1620941394, now seen corresponding path program 1 times [2021-01-06 13:38:24,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:24,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445713393] [2021-01-06 13:38:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-06 13:38:25,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445713393] [2021-01-06 13:38:25,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:25,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:25,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016764542] [2021-01-06 13:38:25,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:38:25,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:25,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:38:25,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:38:25,012 INFO L87 Difference]: Start difference. First operand 16816 states and 18767 transitions. Second operand 4 states. [2021-01-06 13:38:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:27,423 INFO L93 Difference]: Finished difference Result 35293 states and 39385 transitions. [2021-01-06 13:38:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:27,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2021-01-06 13:38:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:27,459 INFO L225 Difference]: With dead ends: 35293 [2021-01-06 13:38:27,460 INFO L226 Difference]: Without dead ends: 18847 [2021-01-06 13:38:27,473 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 13:38:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2021-01-06 13:38:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 17738. [2021-01-06 13:38:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17738 states. [2021-01-06 13:38:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 19737 transitions. [2021-01-06 13:38:27,795 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 19737 transitions. Word has length 341 [2021-01-06 13:38:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:27,796 INFO L481 AbstractCegarLoop]: Abstraction has 17738 states and 19737 transitions. [2021-01-06 13:38:27,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 19737 transitions. [2021-01-06 13:38:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2021-01-06 13:38:27,807 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:27,809 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:38:27,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 13:38:27,809 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -874395672, now seen corresponding path program 1 times [2021-01-06 13:38:27,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:27,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967149038] [2021-01-06 13:38:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 271 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:28,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967149038] [2021-01-06 13:38:28,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597213344] [2021-01-06 13:38:28,443 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 13:38:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 13:38:28,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-01-06 13:38:29,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:29,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-01-06 13:38:29,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643861177] [2021-01-06 13:38:29,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:29,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:29,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:38:29,383 INFO L87 Difference]: Start difference. First operand 17738 states and 19737 transitions. Second operand 3 states. [2021-01-06 13:38:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:30,948 INFO L93 Difference]: Finished difference Result 35477 states and 39522 transitions. [2021-01-06 13:38:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:30,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2021-01-06 13:38:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:30,997 INFO L225 Difference]: With dead ends: 35477 [2021-01-06 13:38:30,997 INFO L226 Difference]: Without dead ends: 18109 [2021-01-06 13:38:31,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:38:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18109 states. [2021-01-06 13:38:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18109 to 18106. [2021-01-06 13:38:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18106 states. [2021-01-06 13:38:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18106 states to 18106 states and 20123 transitions. [2021-01-06 13:38:31,483 INFO L78 Accepts]: Start accepts. Automaton has 18106 states and 20123 transitions. Word has length 355 [2021-01-06 13:38:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:31,484 INFO L481 AbstractCegarLoop]: Abstraction has 18106 states and 20123 transitions. [2021-01-06 13:38:31,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 18106 states and 20123 transitions. [2021-01-06 13:38:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-01-06 13:38:31,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:31,498 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, 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, 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 13:38:31,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 13:38:31,712 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1351852439, now seen corresponding path program 1 times [2021-01-06 13:38:31,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:31,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768999044] [2021-01-06 13:38:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 254 proven. 54 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-01-06 13:38:32,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768999044] [2021-01-06 13:38:32,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165029541] [2021-01-06 13:38:32,464 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 13:38:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:32,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:38:32,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-06 13:38:33,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:33,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:33,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31974326] [2021-01-06 13:38:33,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:33,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:33,003 INFO L87 Difference]: Start difference. First operand 18106 states and 20123 transitions. Second operand 3 states. [2021-01-06 13:38:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:34,244 INFO L93 Difference]: Finished difference Result 36764 states and 40822 transitions. [2021-01-06 13:38:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:34,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2021-01-06 13:38:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:34,274 INFO L225 Difference]: With dead ends: 36764 [2021-01-06 13:38:34,274 INFO L226 Difference]: Without dead ends: 18660 [2021-01-06 13:38:34,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 358 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 13:38:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18660 states. [2021-01-06 13:38:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18660 to 17002. [2021-01-06 13:38:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17002 states. [2021-01-06 13:38:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17002 states to 17002 states and 18853 transitions. [2021-01-06 13:38:34,676 INFO L78 Accepts]: Start accepts. Automaton has 17002 states and 18853 transitions. Word has length 358 [2021-01-06 13:38:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:34,677 INFO L481 AbstractCegarLoop]: Abstraction has 17002 states and 18853 transitions. [2021-01-06 13:38:34,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17002 states and 18853 transitions. [2021-01-06 13:38:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2021-01-06 13:38:34,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:34,690 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, 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, 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] [2021-01-06 13:38:34,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:38:34,905 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash -93934851, now seen corresponding path program 1 times [2021-01-06 13:38:34,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:34,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160818233] [2021-01-06 13:38:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 267 proven. 78 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 13:38:35,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160818233] [2021-01-06 13:38:35,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973091113] [2021-01-06 13:38:35,590 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 13:38:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:35,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 13:38:35,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 202 proven. 143 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 13:38:36,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:38:36,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-01-06 13:38:36,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124161083] [2021-01-06 13:38:36,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:38:36,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:38:36,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:38:36,636 INFO L87 Difference]: Start difference. First operand 17002 states and 18853 transitions. Second operand 9 states. [2021-01-06 13:38:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:47,278 INFO L93 Difference]: Finished difference Result 43430 states and 48170 transitions. [2021-01-06 13:38:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 13:38:47,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 375 [2021-01-06 13:38:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:47,326 INFO L225 Difference]: With dead ends: 43430 [2021-01-06 13:38:47,326 INFO L226 Difference]: Without dead ends: 25878 [2021-01-06 13:38:47,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-01-06 13:38:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25878 states. [2021-01-06 13:38:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25878 to 18653. [2021-01-06 13:38:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18653 states. [2021-01-06 13:38:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18653 states to 18653 states and 20404 transitions. [2021-01-06 13:38:47,752 INFO L78 Accepts]: Start accepts. Automaton has 18653 states and 20404 transitions. Word has length 375 [2021-01-06 13:38:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:47,752 INFO L481 AbstractCegarLoop]: Abstraction has 18653 states and 20404 transitions. [2021-01-06 13:38:47,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:38:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18653 states and 20404 transitions. [2021-01-06 13:38:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2021-01-06 13:38:47,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:47,773 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, 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, 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] [2021-01-06 13:38:47,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 13:38:47,989 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1627853402, now seen corresponding path program 1 times [2021-01-06 13:38:47,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:47,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695789342] [2021-01-06 13:38:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 143 proven. 229 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-01-06 13:38:48,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695789342] [2021-01-06 13:38:48,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635008775] [2021-01-06 13:38:48,494 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 13:38:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:48,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 13:38:48,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:49,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:38:49,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-01-06 13:38:49,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644294] [2021-01-06 13:38:49,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:38:49,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:38:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:38:49,649 INFO L87 Difference]: Start difference. First operand 18653 states and 20404 transitions. Second operand 9 states. [2021-01-06 13:38:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:57,940 INFO L93 Difference]: Finished difference Result 52976 states and 57758 transitions. [2021-01-06 13:38:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 13:38:57,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 417 [2021-01-06 13:38:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:58,001 INFO L225 Difference]: With dead ends: 52976 [2021-01-06 13:38:58,001 INFO L226 Difference]: Without dead ends: 34693 [2021-01-06 13:38:58,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2021-01-06 13:38:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34693 states. [2021-01-06 13:38:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34693 to 24178. [2021-01-06 13:38:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24178 states. [2021-01-06 13:38:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24178 states to 24178 states and 26399 transitions. [2021-01-06 13:38:58,409 INFO L78 Accepts]: Start accepts. Automaton has 24178 states and 26399 transitions. Word has length 417 [2021-01-06 13:38:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:58,410 INFO L481 AbstractCegarLoop]: Abstraction has 24178 states and 26399 transitions. [2021-01-06 13:38:58,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:38:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24178 states and 26399 transitions. [2021-01-06 13:38:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2021-01-06 13:38:58,434 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:58,435 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:38:58,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 13:38:58,650 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1101386183, now seen corresponding path program 1 times [2021-01-06 13:38:58,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:58,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505399145] [2021-01-06 13:38:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:38:59,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505399145] [2021-01-06 13:38:59,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:59,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:59,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248462762] [2021-01-06 13:38:59,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:59,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:59,293 INFO L87 Difference]: Start difference. First operand 24178 states and 26399 transitions. Second operand 3 states. [2021-01-06 13:39:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:00,685 INFO L93 Difference]: Finished difference Result 48729 states and 53267 transitions. [2021-01-06 13:39:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:00,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2021-01-06 13:39:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:00,721 INFO L225 Difference]: With dead ends: 48729 [2021-01-06 13:39:00,721 INFO L226 Difference]: Without dead ends: 24921 [2021-01-06 13:39:00,739 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 13:39:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24921 states. [2021-01-06 13:39:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24921 to 24546. [2021-01-06 13:39:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24546 states. [2021-01-06 13:39:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24546 states to 24546 states and 26785 transitions. [2021-01-06 13:39:01,052 INFO L78 Accepts]: Start accepts. Automaton has 24546 states and 26785 transitions. Word has length 511 [2021-01-06 13:39:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:01,052 INFO L481 AbstractCegarLoop]: Abstraction has 24546 states and 26785 transitions. [2021-01-06 13:39:01,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 24546 states and 26785 transitions. [2021-01-06 13:39:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2021-01-06 13:39:01,068 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:01,069 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:39:01,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 13:39:01,069 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:01,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1677270036, now seen corresponding path program 1 times [2021-01-06 13:39:01,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:01,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716536019] [2021-01-06 13:39:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 514 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:39:02,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716536019] [2021-01-06 13:39:02,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252586902] [2021-01-06 13:39:02,324 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 13:39:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:02,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:39:02,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:39:03,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:03,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-01-06 13:39:03,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551060340] [2021-01-06 13:39:03,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:39:03,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:03,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:39:03,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:03,389 INFO L87 Difference]: Start difference. First operand 24546 states and 26785 transitions. Second operand 4 states. [2021-01-06 13:39:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:05,415 INFO L93 Difference]: Finished difference Result 49267 states and 53792 transitions. [2021-01-06 13:39:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:39:05,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 512 [2021-01-06 13:39:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:05,443 INFO L225 Difference]: With dead ends: 49267 [2021-01-06 13:39:05,443 INFO L226 Difference]: Without dead ends: 24907 [2021-01-06 13:39:05,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24907 states. [2021-01-06 13:39:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24907 to 23619. [2021-01-06 13:39:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23619 states. [2021-01-06 13:39:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23619 states to 23619 states and 25637 transitions. [2021-01-06 13:39:05,712 INFO L78 Accepts]: Start accepts. Automaton has 23619 states and 25637 transitions. Word has length 512 [2021-01-06 13:39:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:05,712 INFO L481 AbstractCegarLoop]: Abstraction has 23619 states and 25637 transitions. [2021-01-06 13:39:05,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:39:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23619 states and 25637 transitions. [2021-01-06 13:39:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2021-01-06 13:39:05,726 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:05,726 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:05,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:39:05,934 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1808437552, now seen corresponding path program 1 times [2021-01-06 13:39:05,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:05,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687650173] [2021-01-06 13:39:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 609 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:39:07,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687650173] [2021-01-06 13:39:07,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336735996] [2021-01-06 13:39:07,388 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 13:39:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:07,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:39:07,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2021-01-06 13:39:08,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:08,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2021-01-06 13:39:08,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894461946] [2021-01-06 13:39:08,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:08,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:39:08,172 INFO L87 Difference]: Start difference. First operand 23619 states and 25637 transitions. Second operand 3 states. [2021-01-06 13:39:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:09,470 INFO L93 Difference]: Finished difference Result 48534 states and 52637 transitions. [2021-01-06 13:39:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:09,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 539 [2021-01-06 13:39:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:09,500 INFO L225 Difference]: With dead ends: 48534 [2021-01-06 13:39:09,500 INFO L226 Difference]: Without dead ends: 25285 [2021-01-06 13:39:09,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:39:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25285 states. [2021-01-06 13:39:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25285 to 23619. [2021-01-06 13:39:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23619 states. [2021-01-06 13:39:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23619 states to 23619 states and 25625 transitions. [2021-01-06 13:39:09,735 INFO L78 Accepts]: Start accepts. Automaton has 23619 states and 25625 transitions. Word has length 539 [2021-01-06 13:39:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:09,735 INFO L481 AbstractCegarLoop]: Abstraction has 23619 states and 25625 transitions. [2021-01-06 13:39:09,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 23619 states and 25625 transitions. [2021-01-06 13:39:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2021-01-06 13:39:09,750 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:09,750 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:09,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 13:39:09,964 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 657391807, now seen corresponding path program 1 times [2021-01-06 13:39:09,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:09,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487059545] [2021-01-06 13:39:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 670 proven. 207 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2021-01-06 13:39:11,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487059545] [2021-01-06 13:39:11,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286599373] [2021-01-06 13:39:11,104 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 13:39:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:39:11,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2021-01-06 13:39:11,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:11,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:39:11,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213519902] [2021-01-06 13:39:11,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:11,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:39:11,932 INFO L87 Difference]: Start difference. First operand 23619 states and 25625 transitions. Second operand 3 states. [2021-01-06 13:39:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:13,488 INFO L93 Difference]: Finished difference Result 52581 states and 57029 transitions. [2021-01-06 13:39:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:13,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 540 [2021-01-06 13:39:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:13,522 INFO L225 Difference]: With dead ends: 52581 [2021-01-06 13:39:13,522 INFO L226 Difference]: Without dead ends: 29332 [2021-01-06 13:39:13,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:39:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29332 states. [2021-01-06 13:39:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29332 to 22521. [2021-01-06 13:39:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22521 states. [2021-01-06 13:39:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22521 states to 22521 states and 24351 transitions. [2021-01-06 13:39:13,876 INFO L78 Accepts]: Start accepts. Automaton has 22521 states and 24351 transitions. Word has length 540 [2021-01-06 13:39:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:13,876 INFO L481 AbstractCegarLoop]: Abstraction has 22521 states and 24351 transitions. [2021-01-06 13:39:13,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22521 states and 24351 transitions. [2021-01-06 13:39:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2021-01-06 13:39:13,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:13,893 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:14,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:39:14,108 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 27903080, now seen corresponding path program 1 times [2021-01-06 13:39:14,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:14,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190841334] [2021-01-06 13:39:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 191 proven. 406 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-01-06 13:39:14,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190841334] [2021-01-06 13:39:14,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467589736] [2021-01-06 13:39:14,886 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 13:39:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:15,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:39:15,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:15,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:39:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 241 proven. 454 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-01-06 13:39:16,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:39:16,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2021-01-06 13:39:16,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775381040] [2021-01-06 13:39:16,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:39:16,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:39:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:39:16,324 INFO L87 Difference]: Start difference. First operand 22521 states and 24351 transitions. Second operand 7 states. [2021-01-06 13:39:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:21,462 INFO L93 Difference]: Finished difference Result 59797 states and 64483 transitions. [2021-01-06 13:39:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:39:21,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 572 [2021-01-06 13:39:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:21,516 INFO L225 Difference]: With dead ends: 59797 [2021-01-06 13:39:21,516 INFO L226 Difference]: Without dead ends: 37646 [2021-01-06 13:39:21,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:39:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37646 states. [2021-01-06 13:39:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37646 to 25109. [2021-01-06 13:39:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25109 states. [2021-01-06 13:39:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25109 states to 25109 states and 27092 transitions. [2021-01-06 13:39:21,898 INFO L78 Accepts]: Start accepts. Automaton has 25109 states and 27092 transitions. Word has length 572 [2021-01-06 13:39:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:21,898 INFO L481 AbstractCegarLoop]: Abstraction has 25109 states and 27092 transitions. [2021-01-06 13:39:21,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:39:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25109 states and 27092 transitions. [2021-01-06 13:39:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2021-01-06 13:39:21,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:21,911 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:39:22,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:39:22,119 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2099919146, now seen corresponding path program 1 times [2021-01-06 13:39:22,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:22,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323335082] [2021-01-06 13:39:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 704 proven. 207 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-01-06 13:39:23,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323335082] [2021-01-06 13:39:23,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280132930] [2021-01-06 13:39:23,278 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 13:39:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:23,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:39:23,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:24,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:39:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 875 proven. 48 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-01-06 13:39:24,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:39:24,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-01-06 13:39:24,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034106279] [2021-01-06 13:39:24,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 13:39:24,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 13:39:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:39:24,604 INFO L87 Difference]: Start difference. First operand 25109 states and 27092 transitions. Second operand 10 states. [2021-01-06 13:39:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:37,636 INFO L93 Difference]: Finished difference Result 67216 states and 72342 transitions. [2021-01-06 13:39:37,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 13:39:37,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 583 [2021-01-06 13:39:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:37,684 INFO L225 Difference]: With dead ends: 67216 [2021-01-06 13:39:37,684 INFO L226 Difference]: Without dead ends: 42477 [2021-01-06 13:39:37,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2021-01-06 13:39:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42477 states. [2021-01-06 13:39:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42477 to 21416. [2021-01-06 13:39:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21416 states. [2021-01-06 13:39:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21416 states to 21416 states and 23107 transitions. [2021-01-06 13:39:38,108 INFO L78 Accepts]: Start accepts. Automaton has 21416 states and 23107 transitions. Word has length 583 [2021-01-06 13:39:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:38,109 INFO L481 AbstractCegarLoop]: Abstraction has 21416 states and 23107 transitions. [2021-01-06 13:39:38,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 13:39:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 21416 states and 23107 transitions. [2021-01-06 13:39:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2021-01-06 13:39:38,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:38,121 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:38,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-01-06 13:39:38,322 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1930042227, now seen corresponding path program 1 times [2021-01-06 13:39:38,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:38,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461701553] [2021-01-06 13:39:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-01-06 13:39:38,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461701553] [2021-01-06 13:39:38,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:38,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:38,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713188069] [2021-01-06 13:39:38,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:39:38,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:38,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:39:38,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:39:38,856 INFO L87 Difference]: Start difference. First operand 21416 states and 23107 transitions. Second operand 4 states. [2021-01-06 13:39:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:41,566 INFO L93 Difference]: Finished difference Result 52977 states and 56995 transitions. [2021-01-06 13:39:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:39:41,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 586 [2021-01-06 13:39:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:41,601 INFO L225 Difference]: With dead ends: 52977 [2021-01-06 13:39:41,602 INFO L226 Difference]: Without dead ends: 30825 [2021-01-06 13:39:41,617 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 13:39:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30825 states. [2021-01-06 13:39:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30825 to 26754. [2021-01-06 13:39:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26754 states. [2021-01-06 13:39:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26754 states to 26754 states and 28778 transitions. [2021-01-06 13:39:41,920 INFO L78 Accepts]: Start accepts. Automaton has 26754 states and 28778 transitions. Word has length 586 [2021-01-06 13:39:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:41,920 INFO L481 AbstractCegarLoop]: Abstraction has 26754 states and 28778 transitions. [2021-01-06 13:39:41,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:39:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 26754 states and 28778 transitions. [2021-01-06 13:39:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2021-01-06 13:39:41,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:41,936 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 13:39:41,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 13:39:41,936 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1222165281, now seen corresponding path program 1 times [2021-01-06 13:39:41,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:41,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974415976] [2021-01-06 13:39:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 919 proven. 255 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-01-06 13:39:43,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974415976] [2021-01-06 13:39:43,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380799901] [2021-01-06 13:39:43,132 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 13:39:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:43,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:39:43,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 877 proven. 105 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2021-01-06 13:39:44,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:39:44,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2021-01-06 13:39:44,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987260875] [2021-01-06 13:39:44,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 13:39:44,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:44,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 13:39:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:44,768 INFO L87 Difference]: Start difference. First operand 26754 states and 28778 transitions. Second operand 8 states. [2021-01-06 13:39:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:54,357 INFO L93 Difference]: Finished difference Result 64590 states and 69407 transitions. [2021-01-06 13:39:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 13:39:54,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 692 [2021-01-06 13:39:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:54,395 INFO L225 Difference]: With dead ends: 64590 [2021-01-06 13:39:54,396 INFO L226 Difference]: Without dead ends: 38574 [2021-01-06 13:39:54,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-01-06 13:39:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2021-01-06 13:39:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 31356. [2021-01-06 13:39:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31356 states. [2021-01-06 13:39:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31356 states to 31356 states and 33686 transitions. [2021-01-06 13:39:54,781 INFO L78 Accepts]: Start accepts. Automaton has 31356 states and 33686 transitions. Word has length 692 [2021-01-06 13:39:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:54,782 INFO L481 AbstractCegarLoop]: Abstraction has 31356 states and 33686 transitions. [2021-01-06 13:39:54,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 13:39:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31356 states and 33686 transitions. [2021-01-06 13:39:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2021-01-06 13:39:54,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:54,799 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, 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, 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, 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] [2021-01-06 13:39:55,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 13:39:55,008 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 866556038, now seen corresponding path program 1 times [2021-01-06 13:39:55,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:55,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776434445] [2021-01-06 13:39:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-01-06 13:39:55,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776434445] [2021-01-06 13:39:55,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:55,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:55,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562300881] [2021-01-06 13:39:55,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:55,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:55,666 INFO L87 Difference]: Start difference. First operand 31356 states and 33686 transitions. Second operand 3 states. [2021-01-06 13:39:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:57,416 INFO L93 Difference]: Finished difference Result 62349 states and 66981 transitions. [2021-01-06 13:39:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:57,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2021-01-06 13:39:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:57,460 INFO L225 Difference]: With dead ends: 62349 [2021-01-06 13:39:57,460 INFO L226 Difference]: Without dead ends: 33019 [2021-01-06 13:39:57,481 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 13:39:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33019 states. [2021-01-06 13:39:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33019 to 29148. [2021-01-06 13:39:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29148 states. [2021-01-06 13:39:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29148 states to 29148 states and 31309 transitions. [2021-01-06 13:39:57,816 INFO L78 Accepts]: Start accepts. Automaton has 29148 states and 31309 transitions. Word has length 732 [2021-01-06 13:39:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:57,817 INFO L481 AbstractCegarLoop]: Abstraction has 29148 states and 31309 transitions. [2021-01-06 13:39:57,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 29148 states and 31309 transitions. [2021-01-06 13:39:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2021-01-06 13:39:57,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:57,836 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, 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, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:39:57,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 13:39:57,836 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:57,837 INFO L82 PathProgramCache]: Analyzing trace with hash 472435046, now seen corresponding path program 1 times [2021-01-06 13:39:57,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:57,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302478053] [2021-01-06 13:39:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2021-01-06 13:39:58,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302478053] [2021-01-06 13:39:58,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:58,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:58,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075184136] [2021-01-06 13:39:58,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:58,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:58,730 INFO L87 Difference]: Start difference. First operand 29148 states and 31309 transitions. Second operand 3 states. [2021-01-06 13:40:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:00,393 INFO L93 Difference]: Finished difference Result 59223 states and 63662 transitions. [2021-01-06 13:40:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:40:00,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 792 [2021-01-06 13:40:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:00,424 INFO L225 Difference]: With dead ends: 59223 [2021-01-06 13:40:00,424 INFO L226 Difference]: Without dead ends: 30445 [2021-01-06 13:40:00,439 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 13:40:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30445 states. [2021-01-06 13:40:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30445 to 20494. [2021-01-06 13:40:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20494 states. [2021-01-06 13:40:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20494 states to 20494 states and 21932 transitions. [2021-01-06 13:40:00,868 INFO L78 Accepts]: Start accepts. Automaton has 20494 states and 21932 transitions. Word has length 792 [2021-01-06 13:40:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:00,868 INFO L481 AbstractCegarLoop]: Abstraction has 20494 states and 21932 transitions. [2021-01-06 13:40:00,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:40:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20494 states and 21932 transitions. [2021-01-06 13:40:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2021-01-06 13:40:00,884 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:00,884 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, 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, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-01-06 13:40:00,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 13:40:00,885 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:00,885 INFO L82 PathProgramCache]: Analyzing trace with hash 161656794, now seen corresponding path program 1 times [2021-01-06 13:40:00,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:00,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019880960] [2021-01-06 13:40:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2903 backedges. 1941 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2021-01-06 13:40:01,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019880960] [2021-01-06 13:40:01,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:40:01,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:40:01,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441948080] [2021-01-06 13:40:01,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:40:01,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:40:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:40:01,714 INFO L87 Difference]: Start difference. First operand 20494 states and 21932 transitions. Second operand 3 states. [2021-01-06 13:40:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:03,341 INFO L93 Difference]: Finished difference Result 41179 states and 44098 transitions. [2021-01-06 13:40:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:40:03,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 862 [2021-01-06 13:40:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:03,364 INFO L225 Difference]: With dead ends: 41179 [2021-01-06 13:40:03,364 INFO L226 Difference]: Without dead ends: 21423 [2021-01-06 13:40:03,377 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 13:40:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2021-01-06 13:40:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 20310. [2021-01-06 13:40:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20310 states. [2021-01-06 13:40:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20310 states to 20310 states and 21731 transitions. [2021-01-06 13:40:03,617 INFO L78 Accepts]: Start accepts. Automaton has 20310 states and 21731 transitions. Word has length 862 [2021-01-06 13:40:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:03,617 INFO L481 AbstractCegarLoop]: Abstraction has 20310 states and 21731 transitions. [2021-01-06 13:40:03,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:40:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20310 states and 21731 transitions. [2021-01-06 13:40:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2021-01-06 13:40:03,634 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:03,634 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-01-06 13:40:03,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 13:40:03,635 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -39729776, now seen corresponding path program 1 times [2021-01-06 13:40:03,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:03,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475694243] [2021-01-06 13:40:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 1341 proven. 204 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2021-01-06 13:40:04,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475694243] [2021-01-06 13:40:04,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642686023] [2021-01-06 13:40:04,772 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 13:40:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:05,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:40:05,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:40:06,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:40:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 1391 proven. 252 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2021-01-06 13:40:06,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:40:06,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2021-01-06 13:40:06,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627781589] [2021-01-06 13:40:06,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:40:06,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:40:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:40:06,942 INFO L87 Difference]: Start difference. First operand 20310 states and 21731 transitions. Second operand 7 states. [2021-01-06 13:40:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:13,162 INFO L93 Difference]: Finished difference Result 28976 states and 30875 transitions. [2021-01-06 13:40:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:40:13,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 877 [2021-01-06 13:40:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:13,192 INFO L225 Difference]: With dead ends: 28976 [2021-01-06 13:40:13,192 INFO L226 Difference]: Without dead ends: 28974 [2021-01-06 13:40:13,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 875 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:40:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2021-01-06 13:40:13,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 18274. [2021-01-06 13:40:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2021-01-06 13:40:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 19538 transitions. [2021-01-06 13:40:13,571 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 19538 transitions. Word has length 877 [2021-01-06 13:40:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:13,572 INFO L481 AbstractCegarLoop]: Abstraction has 18274 states and 19538 transitions. [2021-01-06 13:40:13,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:40:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 19538 transitions. [2021-01-06 13:40:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2021-01-06 13:40:13,586 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:13,586 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:40:13,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:40:13,788 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash 681643502, now seen corresponding path program 1 times [2021-01-06 13:40:13,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:13,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027756413] [2021-01-06 13:40:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2979 backedges. 1983 proven. 0 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2021-01-06 13:40:14,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027756413] [2021-01-06 13:40:14,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:40:14,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:40:14,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662216203] [2021-01-06 13:40:14,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:40:14,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:40:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:40:14,404 INFO L87 Difference]: Start difference. First operand 18274 states and 19538 transitions. Second operand 3 states. [2021-01-06 13:40:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:15,946 INFO L93 Difference]: Finished difference Result 36181 states and 38687 transitions. [2021-01-06 13:40:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:40:15,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 885 [2021-01-06 13:40:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:15,965 INFO L225 Difference]: With dead ends: 36181 [2021-01-06 13:40:15,965 INFO L226 Difference]: Without dead ends: 18461 [2021-01-06 13:40:15,974 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 13:40:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2021-01-06 13:40:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 17168. [2021-01-06 13:40:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17168 states. [2021-01-06 13:40:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17168 states to 17168 states and 18361 transitions. [2021-01-06 13:40:16,177 INFO L78 Accepts]: Start accepts. Automaton has 17168 states and 18361 transitions. Word has length 885 [2021-01-06 13:40:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:16,178 INFO L481 AbstractCegarLoop]: Abstraction has 17168 states and 18361 transitions. [2021-01-06 13:40:16,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:40:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17168 states and 18361 transitions. [2021-01-06 13:40:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2021-01-06 13:40:16,193 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:16,194 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, 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, 9, 9, 9, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2021-01-06 13:40:16,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 13:40:16,194 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1868038389, now seen corresponding path program 1 times [2021-01-06 13:40:16,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:16,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797065231] [2021-01-06 13:40:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3816 backedges. 2836 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2021-01-06 13:40:17,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797065231] [2021-01-06 13:40:17,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:40:17,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:40:17,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085923040] [2021-01-06 13:40:17,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:40:17,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:40:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:40:17,348 INFO L87 Difference]: Start difference. First operand 17168 states and 18361 transitions. Second operand 4 states. [2021-01-06 13:40:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:20,360 INFO L93 Difference]: Finished difference Result 40795 states and 43562 transitions. [2021-01-06 13:40:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:40:20,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1044 [2021-01-06 13:40:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:20,386 INFO L225 Difference]: With dead ends: 40795 [2021-01-06 13:40:20,386 INFO L226 Difference]: Without dead ends: 23445 [2021-01-06 13:40:20,396 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 13:40:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23445 states. [2021-01-06 13:40:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23445 to 18102. [2021-01-06 13:40:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18102 states. [2021-01-06 13:40:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18102 states to 18102 states and 19339 transitions. [2021-01-06 13:40:20,637 INFO L78 Accepts]: Start accepts. Automaton has 18102 states and 19339 transitions. Word has length 1044 [2021-01-06 13:40:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:20,637 INFO L481 AbstractCegarLoop]: Abstraction has 18102 states and 19339 transitions. [2021-01-06 13:40:20,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:40:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18102 states and 19339 transitions. [2021-01-06 13:40:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1589 [2021-01-06 13:40:20,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:20,750 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 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, 5, 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, 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 13:40:20,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 13:40:20,750 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1807030002, now seen corresponding path program 1 times [2021-01-06 13:40:20,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:20,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957512868] [2021-01-06 13:40:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 4757 proven. 206 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2021-01-06 13:40:24,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957512868] [2021-01-06 13:40:24,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066566915] [2021-01-06 13:40:24,539 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 13:40:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:25,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 2021 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-06 13:40:25,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:40:26,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:40:26,632 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 13:40:26,636 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 13:40:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 5132 proven. 282 refuted. 0 times theorem prover too weak. 2855 trivial. 0 not checked. [2021-01-06 13:40:30,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:40:30,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2021-01-06 13:40:30,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165628886] [2021-01-06 13:40:30,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 13:40:30,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 13:40:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:40:30,587 INFO L87 Difference]: Start difference. First operand 18102 states and 19339 transitions. Second operand 10 states. [2021-01-06 13:40:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:39,791 INFO L93 Difference]: Finished difference Result 36847 states and 39340 transitions. [2021-01-06 13:40:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 13:40:39,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1588 [2021-01-06 13:40:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:39,812 INFO L225 Difference]: With dead ends: 36847 [2021-01-06 13:40:39,812 INFO L226 Difference]: Without dead ends: 18379 [2021-01-06 13:40:39,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1604 GetRequests, 1583 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2021-01-06 13:40:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18379 states. [2021-01-06 13:40:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18379 to 15516. [2021-01-06 13:40:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15516 states. [2021-01-06 13:40:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15516 states to 15516 states and 16509 transitions. [2021-01-06 13:40:40,040 INFO L78 Accepts]: Start accepts. Automaton has 15516 states and 16509 transitions. Word has length 1588 [2021-01-06 13:40:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:40,040 INFO L481 AbstractCegarLoop]: Abstraction has 15516 states and 16509 transitions. [2021-01-06 13:40:40,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 13:40:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15516 states and 16509 transitions. [2021-01-06 13:40:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1702 [2021-01-06 13:40:40,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:40,066 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 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, 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] [2021-01-06 13:40:40,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:40:40,267 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash 748776558, now seen corresponding path program 1 times [2021-01-06 13:40:40,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:40,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441959803] [2021-01-06 13:40:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9624 backedges. 6077 proven. 241 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2021-01-06 13:40:44,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441959803] [2021-01-06 13:40:44,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296378656] [2021-01-06 13:40:44,605 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:40:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:45,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 2158 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:40:45,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:40:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9624 backedges. 5826 proven. 0 refuted. 0 times theorem prover too weak. 3798 trivial. 0 not checked. [2021-01-06 13:40:48,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:40:48,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2021-01-06 13:40:48,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096098068] [2021-01-06 13:40:48,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:40:48,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:40:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:40:48,817 INFO L87 Difference]: Start difference. First operand 15516 states and 16509 transitions. Second operand 4 states. [2021-01-06 13:40:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:51,052 INFO L93 Difference]: Finished difference Result 22535 states and 23852 transitions. [2021-01-06 13:40:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:40:51,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1701 [2021-01-06 13:40:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:51,054 INFO L225 Difference]: With dead ends: 22535 [2021-01-06 13:40:51,054 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 13:40:51,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1699 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:40:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 13:40:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 13:40:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 13:40:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 13:40:51,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1701 [2021-01-06 13:40:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:51,063 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 13:40:51,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:40:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 13:40:51,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 13:40:51,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-06 13:40:51,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 13:40:59,326 WARN L197 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 1653 DAG size of output: 1373 [2021-01-06 13:41:06,287 WARN L197 SmtUtils]: Spent 6.95 s on a formula simplification. DAG size of input: 1650 DAG size of output: 1373 [2021-01-06 13:41:31,765 WARN L197 SmtUtils]: Spent 25.46 s on a formula simplification. DAG size of input: 1306 DAG size of output: 153