/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_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:37:47,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:37:47,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:37:47,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:37:47,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:37:47,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:37:47,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:37:47,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:37:47,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:37:47,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:37:47,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:37:47,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:37:47,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:37:47,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:37:47,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:37:47,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:37:47,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:37:47,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:37:47,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:37:47,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:37:47,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:37:47,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:37:47,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:37:47,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:37:47,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:37:47,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:37:47,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:37:47,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:37:47,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:37:47,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:37:47,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:37:47,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:37:47,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:37:47,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:37:47,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:37:47,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:37:47,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:37:47,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:37:47,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:37:47,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:37:47,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:37:47,458 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:47,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:37:47,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:37:47,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:37:47,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:37:47,485 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:37:47,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:37:47,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:37:47,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:37:47,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:37:47,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:37:47,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:37:47,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:37:47,487 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:37:47,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:37:47,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:37:47,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:37:47,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:37:47,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:37:47,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:37:47,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:37:47,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:37:47,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:37:47,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:37:47,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:37:47,489 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:37:47,489 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:47,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:37:47,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:37:47,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:37:47,892 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:37:47,893 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:37:47,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label46.c [2021-01-06 13:37:47,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/83080f79e/8bfeddfbcf2741768eaf90ca26d71274/FLAG535381f3b [2021-01-06 13:37:48,784 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:37:48,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c [2021-01-06 13:37:48,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/83080f79e/8bfeddfbcf2741768eaf90ca26d71274/FLAG535381f3b [2021-01-06 13:37:48,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/83080f79e/8bfeddfbcf2741768eaf90ca26d71274 [2021-01-06 13:37:48,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:37:48,968 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:37:48,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:37:48,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:37:48,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:37:48,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:37:48" (1/1) ... [2021-01-06 13:37:48,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348599a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:48, skipping insertion in model container [2021-01-06 13:37:48,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:37:48" (1/1) ... [2021-01-06 13:37:48,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:37:49,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:37:49,296 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_label46.c[8949,8962] 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:49,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:37:49,651 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:37:49,711 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_label46.c[8949,8962] 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:49,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:37:49,907 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:37:49,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:49 WrapperNode [2021-01-06 13:37:49,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:37:49,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:37:49,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:37:49,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:37:49,918 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:49" (1/1) ... [2021-01-06 13:37:49,961 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:49" (1/1) ... [2021-01-06 13:37:50,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:37:50,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:37:50,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:37:50,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:37:50,089 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:49" (1/1) ... [2021-01-06 13:37:50,089 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:49" (1/1) ... [2021-01-06 13:37:50,099 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:49" (1/1) ... [2021-01-06 13:37:50,100 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:49" (1/1) ... [2021-01-06 13:37:50,154 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:49" (1/1) ... [2021-01-06 13:37:50,168 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:49" (1/1) ... [2021-01-06 13:37:50,192 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:49" (1/1) ... [2021-01-06 13:37:50,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:37:50,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:37:50,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:37:50,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:37:50,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:49" (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:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:37:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:37:50,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:37:50,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:37:52,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:37:52,085 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:37:52,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:37:52 BoogieIcfgContainer [2021-01-06 13:37:52,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:37:52,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:37:52,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:37:52,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:37:52,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:37:48" (1/3) ... [2021-01-06 13:37:52,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44a62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:37:52, skipping insertion in model container [2021-01-06 13:37:52,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:37:49" (2/3) ... [2021-01-06 13:37:52,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44a62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:37:52, skipping insertion in model container [2021-01-06 13:37:52,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:37:52" (3/3) ... [2021-01-06 13:37:52,097 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label46.c [2021-01-06 13:37:52,104 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:37:52,110 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:37:52,132 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:37:52,164 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:37:52,164 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:37:52,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:37:52,165 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:37:52,165 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:37:52,165 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:37:52,165 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:37:52,165 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:37:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2021-01-06 13:37:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 13:37:52,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:52,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:37:52,200 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2021-01-06 13:37:52,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:52,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973882080] [2021-01-06 13:37:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:52,588 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:52,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973882080] [2021-01-06 13:37:52,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:52,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:52,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538292680] [2021-01-06 13:37:52,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:52,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:52,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:52,623 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2021-01-06 13:37:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:54,071 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2021-01-06 13:37:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:54,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 13:37:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:54,093 INFO L225 Difference]: With dead ends: 776 [2021-01-06 13:37:54,093 INFO L226 Difference]: Without dead ends: 413 [2021-01-06 13:37:54,098 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:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-01-06 13:37:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2021-01-06 13:37:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2021-01-06 13:37:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2021-01-06 13:37:54,173 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 62 [2021-01-06 13:37:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:54,174 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2021-01-06 13:37:54,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2021-01-06 13:37:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 13:37:54,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:54,180 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, 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] [2021-01-06 13:37:54,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:37:54,180 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1066754174, now seen corresponding path program 1 times [2021-01-06 13:37:54,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:54,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734436177] [2021-01-06 13:37:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:54,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734436177] [2021-01-06 13:37:54,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:54,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:54,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902340750] [2021-01-06 13:37:54,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:54,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:54,401 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 3 states. [2021-01-06 13:37:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:55,524 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2021-01-06 13:37:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:55,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2021-01-06 13:37:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:55,532 INFO L225 Difference]: With dead ends: 1209 [2021-01-06 13:37:55,532 INFO L226 Difference]: Without dead ends: 800 [2021-01-06 13:37:55,534 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,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-01-06 13:37:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2021-01-06 13:37:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2021-01-06 13:37:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2021-01-06 13:37:55,612 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 130 [2021-01-06 13:37:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:55,614 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2021-01-06 13:37:55,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2021-01-06 13:37:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 13:37:55,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:55,621 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, 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] [2021-01-06 13:37:55,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:37:55,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1046029789, now seen corresponding path program 1 times [2021-01-06 13:37:55,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:55,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105111186] [2021-01-06 13:37:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:55,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105111186] [2021-01-06 13:37:55,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:55,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:55,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263866884] [2021-01-06 13:37:55,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:55,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:55,849 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand 3 states. [2021-01-06 13:37:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:57,031 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2021-01-06 13:37:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:57,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2021-01-06 13:37:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:57,044 INFO L225 Difference]: With dead ends: 1941 [2021-01-06 13:37:57,044 INFO L226 Difference]: Without dead ends: 1156 [2021-01-06 13:37:57,045 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,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2021-01-06 13:37:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2021-01-06 13:37:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2021-01-06 13:37:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2021-01-06 13:37:57,077 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 132 [2021-01-06 13:37:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:57,078 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2021-01-06 13:37:57,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2021-01-06 13:37:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-01-06 13:37:57,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:57,080 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, 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] [2021-01-06 13:37:57,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:37:57,081 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1696825530, now seen corresponding path program 1 times [2021-01-06 13:37:57,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:57,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304153949] [2021-01-06 13:37:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-01-06 13:37:57,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304153949] [2021-01-06 13:37:57,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:57,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:37:57,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389621730] [2021-01-06 13:37:57,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:37:57,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:37:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:37:57,311 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand 3 states. [2021-01-06 13:37:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:37:58,536 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2021-01-06 13:37:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:37:58,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2021-01-06 13:37:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:37:58,548 INFO L225 Difference]: With dead ends: 3056 [2021-01-06 13:37:58,548 INFO L226 Difference]: Without dead ends: 1902 [2021-01-06 13:37:58,550 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:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2021-01-06 13:37:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2021-01-06 13:37:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2021-01-06 13:37:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2021-01-06 13:37:58,594 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 174 [2021-01-06 13:37:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:37:58,595 INFO L481 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2021-01-06 13:37:58,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:37:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2021-01-06 13:37:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-01-06 13:37:58,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:37:58,598 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, 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] [2021-01-06 13:37:58,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:37:58,598 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:37:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:37:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1298901279, now seen corresponding path program 1 times [2021-01-06 13:37:58,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:37:58,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004921879] [2021-01-06 13:37:58,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:37:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:37:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:37:58,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004921879] [2021-01-06 13:37:58,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:37:58,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:37:58,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726126508] [2021-01-06 13:37:58,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:37:58,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:37:58,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:37:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:37:58,814 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand 4 states. [2021-01-06 13:38:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:00,743 INFO L93 Difference]: Finished difference Result 5670 states and 7167 transitions. [2021-01-06 13:38:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:00,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2021-01-06 13:38:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:00,769 INFO L225 Difference]: With dead ends: 5670 [2021-01-06 13:38:00,769 INFO L226 Difference]: Without dead ends: 3955 [2021-01-06 13:38:00,775 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:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2021-01-06 13:38:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3954. [2021-01-06 13:38:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3954 states. [2021-01-06 13:38:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 4881 transitions. [2021-01-06 13:38:00,863 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 4881 transitions. Word has length 189 [2021-01-06 13:38:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:00,864 INFO L481 AbstractCegarLoop]: Abstraction has 3954 states and 4881 transitions. [2021-01-06 13:38:00,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 4881 transitions. [2021-01-06 13:38:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-01-06 13:38:00,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:00,872 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:38:00,872 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash 800976377, now seen corresponding path program 1 times [2021-01-06 13:38:00,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:00,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021149057] [2021-01-06 13:38:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:38:01,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021149057] [2021-01-06 13:38:01,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:01,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:01,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31663478] [2021-01-06 13:38:01,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:01,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:01,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:01,121 INFO L87 Difference]: Start difference. First operand 3954 states and 4881 transitions. Second operand 3 states. [2021-01-06 13:38:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:02,531 INFO L93 Difference]: Finished difference Result 8638 states and 10797 transitions. [2021-01-06 13:38:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:02,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2021-01-06 13:38:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:02,558 INFO L225 Difference]: With dead ends: 8638 [2021-01-06 13:38:02,558 INFO L226 Difference]: Without dead ends: 5243 [2021-01-06 13:38:02,563 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,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2021-01-06 13:38:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5243. [2021-01-06 13:38:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2021-01-06 13:38:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6463 transitions. [2021-01-06 13:38:02,686 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6463 transitions. Word has length 244 [2021-01-06 13:38:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:02,688 INFO L481 AbstractCegarLoop]: Abstraction has 5243 states and 6463 transitions. [2021-01-06 13:38:02,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6463 transitions. [2021-01-06 13:38:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-01-06 13:38:02,694 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:02,695 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:02,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:38:02,695 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1479441116, now seen corresponding path program 1 times [2021-01-06 13:38:02,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:02,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047592426] [2021-01-06 13:38:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 13:38:02,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047592426] [2021-01-06 13:38:02,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:02,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:02,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287261401] [2021-01-06 13:38:02,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:02,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:02,979 INFO L87 Difference]: Start difference. First operand 5243 states and 6463 transitions. Second operand 3 states. [2021-01-06 13:38:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:04,386 INFO L93 Difference]: Finished difference Result 11964 states and 14986 transitions. [2021-01-06 13:38:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:04,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2021-01-06 13:38:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:04,418 INFO L225 Difference]: With dead ends: 11964 [2021-01-06 13:38:04,418 INFO L226 Difference]: Without dead ends: 6907 [2021-01-06 13:38:04,426 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,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2021-01-06 13:38:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 6898. [2021-01-06 13:38:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6898 states. [2021-01-06 13:38:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 8375 transitions. [2021-01-06 13:38:04,599 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 8375 transitions. Word has length 255 [2021-01-06 13:38:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:04,600 INFO L481 AbstractCegarLoop]: Abstraction has 6898 states and 8375 transitions. [2021-01-06 13:38:04,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 8375 transitions. [2021-01-06 13:38:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-01-06 13:38:04,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:04,609 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:38:04,609 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:04,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash 804479466, now seen corresponding path program 1 times [2021-01-06 13:38:04,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:04,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017517591] [2021-01-06 13:38:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 119 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:04,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017517591] [2021-01-06 13:38:04,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496820535] [2021-01-06 13:38:04,951 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:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:05,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:38:05,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:05,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:05,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:05,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717601777] [2021-01-06 13:38:05,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:05,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:05,594 INFO L87 Difference]: Start difference. First operand 6898 states and 8375 transitions. Second operand 3 states. [2021-01-06 13:38:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:06,839 INFO L93 Difference]: Finished difference Result 14918 states and 18397 transitions. [2021-01-06 13:38:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:06,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2021-01-06 13:38:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:06,909 INFO L225 Difference]: With dead ends: 14918 [2021-01-06 13:38:06,910 INFO L226 Difference]: Without dead ends: 8390 [2021-01-06 13:38:06,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 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:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8390 states. [2021-01-06 13:38:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8390 to 8187. [2021-01-06 13:38:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2021-01-06 13:38:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 9978 transitions. [2021-01-06 13:38:07,055 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 9978 transitions. Word has length 275 [2021-01-06 13:38:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:07,056 INFO L481 AbstractCegarLoop]: Abstraction has 8187 states and 9978 transitions. [2021-01-06 13:38:07,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 9978 transitions. [2021-01-06 13:38:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-01-06 13:38:07,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:07,065 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:07,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-01-06 13:38:07,280 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1603746634, now seen corresponding path program 1 times [2021-01-06 13:38:07,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:07,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430938483] [2021-01-06 13:38:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-01-06 13:38:07,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430938483] [2021-01-06 13:38:07,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:07,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:07,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910119570] [2021-01-06 13:38:07,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:07,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:07,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:07,556 INFO L87 Difference]: Start difference. First operand 8187 states and 9978 transitions. Second operand 3 states. [2021-01-06 13:38:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:08,868 INFO L93 Difference]: Finished difference Result 17853 states and 22069 transitions. [2021-01-06 13:38:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:08,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2021-01-06 13:38:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:08,912 INFO L225 Difference]: With dead ends: 17853 [2021-01-06 13:38:08,913 INFO L226 Difference]: Without dead ends: 10035 [2021-01-06 13:38:08,923 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:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10035 states. [2021-01-06 13:38:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10035 to 9659. [2021-01-06 13:38:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9659 states. [2021-01-06 13:38:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 11612 transitions. [2021-01-06 13:38:09,069 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 11612 transitions. Word has length 293 [2021-01-06 13:38:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:09,070 INFO L481 AbstractCegarLoop]: Abstraction has 9659 states and 11612 transitions. [2021-01-06 13:38:09,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 11612 transitions. [2021-01-06 13:38:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2021-01-06 13:38:09,082 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:09,083 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 13:38:09,083 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash -584277450, now seen corresponding path program 1 times [2021-01-06 13:38:09,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:09,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158752010] [2021-01-06 13:38:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:09,646 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2021-01-06 13:38:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:10,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158752010] [2021-01-06 13:38:10,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203766592] [2021-01-06 13:38:10,274 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:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:38:10,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:10,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:10,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2021-01-06 13:38:10,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380616259] [2021-01-06 13:38:10,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:10,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:10,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:38:10,780 INFO L87 Difference]: Start difference. First operand 9659 states and 11612 transitions. Second operand 3 states. [2021-01-06 13:38:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:11,981 INFO L93 Difference]: Finished difference Result 19148 states and 23068 transitions. [2021-01-06 13:38:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:11,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2021-01-06 13:38:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:12,004 INFO L225 Difference]: With dead ends: 19148 [2021-01-06 13:38:12,004 INFO L226 Difference]: Without dead ends: 9859 [2021-01-06 13:38:12,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:38:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9859 states. [2021-01-06 13:38:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9859 to 9843. [2021-01-06 13:38:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9843 states. [2021-01-06 13:38:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 11652 transitions. [2021-01-06 13:38:12,159 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 11652 transitions. Word has length 313 [2021-01-06 13:38:12,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:12,160 INFO L481 AbstractCegarLoop]: Abstraction has 9843 states and 11652 transitions. [2021-01-06 13:38:12,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 11652 transitions. [2021-01-06 13:38:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2021-01-06 13:38:12,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:12,173 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 13:38:12,386 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1083422029, now seen corresponding path program 1 times [2021-01-06 13:38:12,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:12,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308875599] [2021-01-06 13:38:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 13:38:12,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308875599] [2021-01-06 13:38:12,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:12,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:12,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615690755] [2021-01-06 13:38:12,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:12,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:12,633 INFO L87 Difference]: Start difference. First operand 9843 states and 11652 transitions. Second operand 3 states. [2021-01-06 13:38:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:13,770 INFO L93 Difference]: Finished difference Result 21152 states and 25197 transitions. [2021-01-06 13:38:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:13,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2021-01-06 13:38:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:13,794 INFO L225 Difference]: With dead ends: 21152 [2021-01-06 13:38:13,794 INFO L226 Difference]: Without dead ends: 11679 [2021-01-06 13:38:13,808 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:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11679 states. [2021-01-06 13:38:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11679 to 9833. [2021-01-06 13:38:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9833 states. [2021-01-06 13:38:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9833 states to 9833 states and 11220 transitions. [2021-01-06 13:38:13,954 INFO L78 Accepts]: Start accepts. Automaton has 9833 states and 11220 transitions. Word has length 329 [2021-01-06 13:38:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:13,954 INFO L481 AbstractCegarLoop]: Abstraction has 9833 states and 11220 transitions. [2021-01-06 13:38:13,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9833 states and 11220 transitions. [2021-01-06 13:38:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2021-01-06 13:38:13,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:13,968 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:13,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 13:38:13,968 INFO L429 AbstractCegarLoop]: === Iteration 12 === [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 -1150896741, now seen corresponding path program 1 times [2021-01-06 13:38:13,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:13,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145918289] [2021-01-06 13:38:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:14,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145918289] [2021-01-06 13:38:14,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:14,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:14,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324518107] [2021-01-06 13:38:14,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:38:14,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:38:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:38:14,421 INFO L87 Difference]: Start difference. First operand 9833 states and 11220 transitions. Second operand 4 states. [2021-01-06 13:38:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:16,517 INFO L93 Difference]: Finished difference Result 24273 states and 27818 transitions. [2021-01-06 13:38:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:16,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2021-01-06 13:38:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:16,546 INFO L225 Difference]: With dead ends: 24273 [2021-01-06 13:38:16,546 INFO L226 Difference]: Without dead ends: 14441 [2021-01-06 13:38:16,560 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:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14441 states. [2021-01-06 13:38:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14441 to 14436. [2021-01-06 13:38:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14436 states. [2021-01-06 13:38:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 16464 transitions. [2021-01-06 13:38:16,791 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 16464 transitions. Word has length 344 [2021-01-06 13:38:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:16,792 INFO L481 AbstractCegarLoop]: Abstraction has 14436 states and 16464 transitions. [2021-01-06 13:38:16,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 16464 transitions. [2021-01-06 13:38:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-01-06 13:38:16,808 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:16,808 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:38:16,809 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1927151928, now seen corresponding path program 1 times [2021-01-06 13:38:16,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:16,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111139543] [2021-01-06 13:38:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 13:38:17,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111139543] [2021-01-06 13:38:17,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:17,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:17,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106097824] [2021-01-06 13:38:17,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:17,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:17,052 INFO L87 Difference]: Start difference. First operand 14436 states and 16464 transitions. Second operand 3 states. [2021-01-06 13:38:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:18,174 INFO L93 Difference]: Finished difference Result 28504 states and 32552 transitions. [2021-01-06 13:38:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:18,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2021-01-06 13:38:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:18,199 INFO L225 Difference]: With dead ends: 28504 [2021-01-06 13:38:18,200 INFO L226 Difference]: Without dead ends: 15730 [2021-01-06 13:38:18,211 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,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2021-01-06 13:38:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 14436. [2021-01-06 13:38:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14436 states. [2021-01-06 13:38:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 16464 transitions. [2021-01-06 13:38:18,396 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 16464 transitions. Word has length 350 [2021-01-06 13:38:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:18,397 INFO L481 AbstractCegarLoop]: Abstraction has 14436 states and 16464 transitions. [2021-01-06 13:38:18,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 16464 transitions. [2021-01-06 13:38:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2021-01-06 13:38:18,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:18,419 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, 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, 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:18,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 13:38:18,420 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -467513356, now seen corresponding path program 1 times [2021-01-06 13:38:18,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:18,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310618961] [2021-01-06 13:38:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-01-06 13:38:18,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310618961] [2021-01-06 13:38:18,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:18,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:18,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273364524] [2021-01-06 13:38:18,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:18,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:18,716 INFO L87 Difference]: Start difference. First operand 14436 states and 16464 transitions. Second operand 3 states. [2021-01-06 13:38:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:19,818 INFO L93 Difference]: Finished difference Result 29417 states and 33608 transitions. [2021-01-06 13:38:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:19,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2021-01-06 13:38:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:19,843 INFO L225 Difference]: With dead ends: 29417 [2021-01-06 13:38:19,843 INFO L226 Difference]: Without dead ends: 16643 [2021-01-06 13:38:19,853 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:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16643 states. [2021-01-06 13:38:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16643 to 11851. [2021-01-06 13:38:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2021-01-06 13:38:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 13619 transitions. [2021-01-06 13:38:20,049 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 13619 transitions. Word has length 382 [2021-01-06 13:38:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:20,050 INFO L481 AbstractCegarLoop]: Abstraction has 11851 states and 13619 transitions. [2021-01-06 13:38:20,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 13619 transitions. [2021-01-06 13:38:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2021-01-06 13:38:20,065 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:20,065 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 13:38:20,066 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 361434429, now seen corresponding path program 1 times [2021-01-06 13:38:20,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:20,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501244532] [2021-01-06 13:38:20,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 124 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:20,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501244532] [2021-01-06 13:38:20,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896592249] [2021-01-06 13:38:20,891 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:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:21,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 13:38:21,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 124 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:38:22,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:38:22,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-01-06 13:38:22,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293137731] [2021-01-06 13:38:22,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:38:22,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:38:22,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:38:22,066 INFO L87 Difference]: Start difference. First operand 11851 states and 13619 transitions. Second operand 9 states. [2021-01-06 13:38:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:27,921 INFO L93 Difference]: Finished difference Result 34747 states and 39937 transitions. [2021-01-06 13:38:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 13:38:27,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2021-01-06 13:38:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:27,963 INFO L225 Difference]: With dead ends: 34747 [2021-01-06 13:38:27,963 INFO L226 Difference]: Without dead ends: 23265 [2021-01-06 13:38:27,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 378 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-01-06 13:38:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23265 states. [2021-01-06 13:38:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23265 to 20327. [2021-01-06 13:38:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20327 states. [2021-01-06 13:38:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20327 states to 20327 states and 22940 transitions. [2021-01-06 13:38:28,433 INFO L78 Accepts]: Start accepts. Automaton has 20327 states and 22940 transitions. Word has length 382 [2021-01-06 13:38:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:28,434 INFO L481 AbstractCegarLoop]: Abstraction has 20327 states and 22940 transitions. [2021-01-06 13:38:28,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:38:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20327 states and 22940 transitions. [2021-01-06 13:38:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2021-01-06 13:38:28,490 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:28,490 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, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:28,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 13:38:28,704 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2142682202, now seen corresponding path program 1 times [2021-01-06 13:38:28,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:28,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516997493] [2021-01-06 13:38:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2021-01-06 13:38:29,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516997493] [2021-01-06 13:38:29,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:29,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:29,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797002777] [2021-01-06 13:38:29,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:29,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:29,245 INFO L87 Difference]: Start difference. First operand 20327 states and 22940 transitions. Second operand 3 states. [2021-01-06 13:38:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:30,554 INFO L93 Difference]: Finished difference Result 40668 states and 45989 transitions. [2021-01-06 13:38:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:30,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 521 [2021-01-06 13:38:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:30,590 INFO L225 Difference]: With dead ends: 40668 [2021-01-06 13:38:30,590 INFO L226 Difference]: Without dead ends: 22001 [2021-01-06 13:38:30,604 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:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22001 states. [2021-01-06 13:38:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22001 to 20691. [2021-01-06 13:38:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20691 states. [2021-01-06 13:38:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20691 states to 20691 states and 23201 transitions. [2021-01-06 13:38:30,912 INFO L78 Accepts]: Start accepts. Automaton has 20691 states and 23201 transitions. Word has length 521 [2021-01-06 13:38:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:30,913 INFO L481 AbstractCegarLoop]: Abstraction has 20691 states and 23201 transitions. [2021-01-06 13:38:30,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 20691 states and 23201 transitions. [2021-01-06 13:38:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2021-01-06 13:38:30,940 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:30,941 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, 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, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:38:30,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 13:38:30,941 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:30,942 INFO L82 PathProgramCache]: Analyzing trace with hash -236333549, now seen corresponding path program 1 times [2021-01-06 13:38:30,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:30,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163683955] [2021-01-06 13:38:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-01-06 13:38:31,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163683955] [2021-01-06 13:38:31,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:31,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:31,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451964442] [2021-01-06 13:38:31,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:31,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:31,387 INFO L87 Difference]: Start difference. First operand 20691 states and 23201 transitions. Second operand 3 states. [2021-01-06 13:38:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:32,753 INFO L93 Difference]: Finished difference Result 46000 states and 51791 transitions. [2021-01-06 13:38:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:32,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2021-01-06 13:38:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:32,792 INFO L225 Difference]: With dead ends: 46000 [2021-01-06 13:38:32,792 INFO L226 Difference]: Without dead ends: 25679 [2021-01-06 13:38:32,808 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:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25679 states. [2021-01-06 13:38:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25679 to 25490. [2021-01-06 13:38:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25490 states. [2021-01-06 13:38:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25490 states to 25490 states and 28507 transitions. [2021-01-06 13:38:33,305 INFO L78 Accepts]: Start accepts. Automaton has 25490 states and 28507 transitions. Word has length 522 [2021-01-06 13:38:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:33,305 INFO L481 AbstractCegarLoop]: Abstraction has 25490 states and 28507 transitions. [2021-01-06 13:38:33,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25490 states and 28507 transitions. [2021-01-06 13:38:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2021-01-06 13:38:33,331 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:33,331 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 13:38:33,332 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 941049859, now seen corresponding path program 1 times [2021-01-06 13:38:33,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:33,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691052860] [2021-01-06 13:38:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-01-06 13:38:33,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691052860] [2021-01-06 13:38:33,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:33,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:33,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978423539] [2021-01-06 13:38:33,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:33,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:33,699 INFO L87 Difference]: Start difference. First operand 25490 states and 28507 transitions. Second operand 3 states. [2021-01-06 13:38:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:35,172 INFO L93 Difference]: Finished difference Result 55579 states and 62178 transitions. [2021-01-06 13:38:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:35,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 526 [2021-01-06 13:38:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:35,213 INFO L225 Difference]: With dead ends: 55579 [2021-01-06 13:38:35,213 INFO L226 Difference]: Without dead ends: 30459 [2021-01-06 13:38:35,231 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:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30459 states. [2021-01-06 13:38:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30459 to 29156. [2021-01-06 13:38:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29156 states. [2021-01-06 13:38:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29156 states to 29156 states and 32423 transitions. [2021-01-06 13:38:35,613 INFO L78 Accepts]: Start accepts. Automaton has 29156 states and 32423 transitions. Word has length 526 [2021-01-06 13:38:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:35,613 INFO L481 AbstractCegarLoop]: Abstraction has 29156 states and 32423 transitions. [2021-01-06 13:38:35,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29156 states and 32423 transitions. [2021-01-06 13:38:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2021-01-06 13:38:35,637 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:35,637 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 13:38:35,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 13:38:35,638 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash -540773030, now seen corresponding path program 1 times [2021-01-06 13:38:35,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:35,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543287900] [2021-01-06 13:38:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 320 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-01-06 13:38:36,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543287900] [2021-01-06 13:38:36,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752776693] [2021-01-06 13:38:36,607 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:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:36,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:38:36,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:36,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:38:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-01-06 13:38:37,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:37,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:38:37,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988235819] [2021-01-06 13:38:37,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:38:37,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:38:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:38:37,514 INFO L87 Difference]: Start difference. First operand 29156 states and 32423 transitions. Second operand 4 states. [2021-01-06 13:38:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:39,737 INFO L93 Difference]: Finished difference Result 63854 states and 71101 transitions. [2021-01-06 13:38:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:39,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2021-01-06 13:38:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:39,773 INFO L225 Difference]: With dead ends: 63854 [2021-01-06 13:38:39,773 INFO L226 Difference]: Without dead ends: 35990 [2021-01-06 13:38:39,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:38:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35990 states. [2021-01-06 13:38:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35990 to 28980. [2021-01-06 13:38:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28980 states. [2021-01-06 13:38:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28980 states to 28980 states and 32295 transitions. [2021-01-06 13:38:40,215 INFO L78 Accepts]: Start accepts. Automaton has 28980 states and 32295 transitions. Word has length 532 [2021-01-06 13:38:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:40,215 INFO L481 AbstractCegarLoop]: Abstraction has 28980 states and 32295 transitions. [2021-01-06 13:38:40,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28980 states and 32295 transitions. [2021-01-06 13:38:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2021-01-06 13:38:40,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:40,245 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:40,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:38:40,460 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1196662528, now seen corresponding path program 1 times [2021-01-06 13:38:40,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:40,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990999319] [2021-01-06 13:38:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 870 proven. 89 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2021-01-06 13:38:41,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990999319] [2021-01-06 13:38:41,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958750314] [2021-01-06 13:38:41,371 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:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:41,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:38:41,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 634 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2021-01-06 13:38:42,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:42,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:42,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936093233] [2021-01-06 13:38:42,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:42,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:42,524 INFO L87 Difference]: Start difference. First operand 28980 states and 32295 transitions. Second operand 3 states. [2021-01-06 13:38:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:43,868 INFO L93 Difference]: Finished difference Result 57211 states and 63631 transitions. [2021-01-06 13:38:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:43,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 612 [2021-01-06 13:38:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:43,903 INFO L225 Difference]: With dead ends: 57211 [2021-01-06 13:38:43,903 INFO L226 Difference]: Without dead ends: 30995 [2021-01-06 13:38:43,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30995 states. [2021-01-06 13:38:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30995 to 28235. [2021-01-06 13:38:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28235 states. [2021-01-06 13:38:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28235 states to 28235 states and 31228 transitions. [2021-01-06 13:38:44,348 INFO L78 Accepts]: Start accepts. Automaton has 28235 states and 31228 transitions. Word has length 612 [2021-01-06 13:38:44,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:44,349 INFO L481 AbstractCegarLoop]: Abstraction has 28235 states and 31228 transitions. [2021-01-06 13:38:44,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28235 states and 31228 transitions. [2021-01-06 13:38:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2021-01-06 13:38:44,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:44,378 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:44,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:38:44,592 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:44,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1745218234, now seen corresponding path program 1 times [2021-01-06 13:38:44,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:44,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135288211] [2021-01-06 13:38:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 894 proven. 89 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-01-06 13:38:45,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135288211] [2021-01-06 13:38:45,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886027585] [2021-01-06 13:38:45,555 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:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:45,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:38:45,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2021-01-06 13:38:46,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:46,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:46,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060529614] [2021-01-06 13:38:46,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:46,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:46,600 INFO L87 Difference]: Start difference. First operand 28235 states and 31228 transitions. Second operand 3 states. [2021-01-06 13:38:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:47,990 INFO L93 Difference]: Finished difference Result 54810 states and 60666 transitions. [2021-01-06 13:38:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:47,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 625 [2021-01-06 13:38:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:48,031 INFO L225 Difference]: With dead ends: 54810 [2021-01-06 13:38:48,031 INFO L226 Difference]: Without dead ends: 29339 [2021-01-06 13:38:48,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 624 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:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29339 states. [2021-01-06 13:38:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29339 to 26567. [2021-01-06 13:38:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26567 states. [2021-01-06 13:38:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26567 states to 26567 states and 29340 transitions. [2021-01-06 13:38:48,411 INFO L78 Accepts]: Start accepts. Automaton has 26567 states and 29340 transitions. Word has length 625 [2021-01-06 13:38:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:48,412 INFO L481 AbstractCegarLoop]: Abstraction has 26567 states and 29340 transitions. [2021-01-06 13:38:48,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26567 states and 29340 transitions. [2021-01-06 13:38:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2021-01-06 13:38:48,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:48,436 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, 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, 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, 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:48,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:38:48,638 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:48,639 INFO L82 PathProgramCache]: Analyzing trace with hash -441751579, now seen corresponding path program 1 times [2021-01-06 13:38:48,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:48,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782643881] [2021-01-06 13:38:48,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 940 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-01-06 13:38:49,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782643881] [2021-01-06 13:38:49,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:49,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:38:49,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007831435] [2021-01-06 13:38:49,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:49,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:38:49,167 INFO L87 Difference]: Start difference. First operand 26567 states and 29340 transitions. Second operand 3 states. [2021-01-06 13:38:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:50,540 INFO L93 Difference]: Finished difference Result 51853 states and 57265 transitions. [2021-01-06 13:38:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:50,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 628 [2021-01-06 13:38:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:50,570 INFO L225 Difference]: With dead ends: 51853 [2021-01-06 13:38:50,570 INFO L226 Difference]: Without dead ends: 28050 [2021-01-06 13:38:50,584 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:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28050 states. [2021-01-06 13:38:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28050 to 26199. [2021-01-06 13:38:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26199 states. [2021-01-06 13:38:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26199 states to 26199 states and 28903 transitions. [2021-01-06 13:38:51,057 INFO L78 Accepts]: Start accepts. Automaton has 26199 states and 28903 transitions. Word has length 628 [2021-01-06 13:38:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:51,057 INFO L481 AbstractCegarLoop]: Abstraction has 26199 states and 28903 transitions. [2021-01-06 13:38:51,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26199 states and 28903 transitions. [2021-01-06 13:38:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2021-01-06 13:38:51,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:51,079 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, 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, 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, 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:38:51,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 13:38:51,079 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash -995991056, now seen corresponding path program 1 times [2021-01-06 13:38:51,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:51,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45422521] [2021-01-06 13:38:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 870 proven. 89 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2021-01-06 13:38:52,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45422521] [2021-01-06 13:38:52,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870142678] [2021-01-06 13:38:52,043 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:38:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:52,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:38:52,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:38:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 634 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2021-01-06 13:38:53,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:38:53,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:38:53,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927379801] [2021-01-06 13:38:53,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:38:53,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:38:53,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:53,044 INFO L87 Difference]: Start difference. First operand 26199 states and 28903 transitions. Second operand 3 states. [2021-01-06 13:38:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:54,403 INFO L93 Difference]: Finished difference Result 52947 states and 58407 transitions. [2021-01-06 13:38:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:38:54,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2021-01-06 13:38:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:54,432 INFO L225 Difference]: With dead ends: 52947 [2021-01-06 13:38:54,432 INFO L226 Difference]: Without dead ends: 27118 [2021-01-06 13:38:54,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:38:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27118 states. [2021-01-06 13:38:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27118 to 25453. [2021-01-06 13:38:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25453 states. [2021-01-06 13:38:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25453 states to 25453 states and 27995 transitions. [2021-01-06 13:38:54,788 INFO L78 Accepts]: Start accepts. Automaton has 25453 states and 27995 transitions. Word has length 645 [2021-01-06 13:38:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:54,789 INFO L481 AbstractCegarLoop]: Abstraction has 25453 states and 27995 transitions. [2021-01-06 13:38:54,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:38:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 25453 states and 27995 transitions. [2021-01-06 13:38:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2021-01-06 13:38:54,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:54,806 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, 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, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:55,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:38:55,022 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash 568745883, now seen corresponding path program 1 times [2021-01-06 13:38:55,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:55,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565744468] [2021-01-06 13:38:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:38:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-01-06 13:38:55,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565744468] [2021-01-06 13:38:55,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:38:55,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:38:55,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951573831] [2021-01-06 13:38:55,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:38:55,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:38:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:38:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:38:55,842 INFO L87 Difference]: Start difference. First operand 25453 states and 27995 transitions. Second operand 4 states. [2021-01-06 13:38:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:38:58,387 INFO L93 Difference]: Finished difference Result 56988 states and 62642 transitions. [2021-01-06 13:38:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:38:58,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 646 [2021-01-06 13:38:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:38:58,422 INFO L225 Difference]: With dead ends: 56988 [2021-01-06 13:38:58,422 INFO L226 Difference]: Without dead ends: 31905 [2021-01-06 13:38:58,438 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:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31905 states. [2021-01-06 13:38:58,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31905 to 22877. [2021-01-06 13:38:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22877 states. [2021-01-06 13:38:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22877 states to 22877 states and 25057 transitions. [2021-01-06 13:38:58,799 INFO L78 Accepts]: Start accepts. Automaton has 22877 states and 25057 transitions. Word has length 646 [2021-01-06 13:38:58,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:38:58,800 INFO L481 AbstractCegarLoop]: Abstraction has 22877 states and 25057 transitions. [2021-01-06 13:38:58,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:38:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22877 states and 25057 transitions. [2021-01-06 13:38:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2021-01-06 13:38:58,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:38:58,820 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:38:58,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 13:38:58,821 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:38:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:38:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1137272937, now seen corresponding path program 1 times [2021-01-06 13:38:58,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:38:58,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398039461] [2021-01-06 13:38:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:38:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 1102 proven. 64 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-01-06 13:39:00,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398039461] [2021-01-06 13:39:00,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063936072] [2021-01-06 13:39:00,225 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:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:00,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:39:00,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 1166 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-01-06 13:39:01,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:01,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:39:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187594243] [2021-01-06 13:39:01,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:01,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:39:01,245 INFO L87 Difference]: Start difference. First operand 22877 states and 25057 transitions. Second operand 3 states. [2021-01-06 13:39:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:02,570 INFO L93 Difference]: Finished difference Result 45759 states and 50101 transitions. [2021-01-06 13:39:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:02,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 708 [2021-01-06 13:39:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:02,589 INFO L225 Difference]: With dead ends: 45759 [2021-01-06 13:39:02,589 INFO L226 Difference]: Without dead ends: 23068 [2021-01-06 13:39:02,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 707 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:39:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23068 states. [2021-01-06 13:39:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23068 to 21589. [2021-01-06 13:39:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21589 states. [2021-01-06 13:39:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21589 states to 21589 states and 23610 transitions. [2021-01-06 13:39:02,809 INFO L78 Accepts]: Start accepts. Automaton has 21589 states and 23610 transitions. Word has length 708 [2021-01-06 13:39:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:02,809 INFO L481 AbstractCegarLoop]: Abstraction has 21589 states and 23610 transitions. [2021-01-06 13:39:02,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 21589 states and 23610 transitions. [2021-01-06 13:39:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2021-01-06 13:39:02,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:02,826 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:03,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 13:39:03,034 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash -98037501, now seen corresponding path program 1 times [2021-01-06 13:39:03,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:03,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085527155] [2021-01-06 13:39:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 1180 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2021-01-06 13:39:03,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085527155] [2021-01-06 13:39:03,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:03,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638669107] [2021-01-06 13:39:03,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:03,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:03,602 INFO L87 Difference]: Start difference. First operand 21589 states and 23610 transitions. Second operand 3 states. [2021-01-06 13:39:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:05,084 INFO L93 Difference]: Finished difference Result 44837 states and 49035 transitions. [2021-01-06 13:39:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:05,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 800 [2021-01-06 13:39:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:05,108 INFO L225 Difference]: With dead ends: 44837 [2021-01-06 13:39:05,109 INFO L226 Difference]: Without dead ends: 23618 [2021-01-06 13:39:05,119 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:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23618 states. [2021-01-06 13:39:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23618 to 21405. [2021-01-06 13:39:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21405 states. [2021-01-06 13:39:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21405 states to 21405 states and 23404 transitions. [2021-01-06 13:39:05,347 INFO L78 Accepts]: Start accepts. Automaton has 21405 states and 23404 transitions. Word has length 800 [2021-01-06 13:39:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:05,348 INFO L481 AbstractCegarLoop]: Abstraction has 21405 states and 23404 transitions. [2021-01-06 13:39:05,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 21405 states and 23404 transitions. [2021-01-06 13:39:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2021-01-06 13:39:05,366 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:05,366 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:05,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 13:39:05,367 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -780467735, now seen corresponding path program 1 times [2021-01-06 13:39:05,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:05,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842639935] [2021-01-06 13:39:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2421 backedges. 1410 proven. 0 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2021-01-06 13:39:06,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842639935] [2021-01-06 13:39:06,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:06,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:06,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181348907] [2021-01-06 13:39:06,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:06,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:06,173 INFO L87 Difference]: Start difference. First operand 21405 states and 23404 transitions. Second operand 3 states. [2021-01-06 13:39:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:07,503 INFO L93 Difference]: Finished difference Result 41331 states and 45065 transitions. [2021-01-06 13:39:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:07,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 845 [2021-01-06 13:39:07,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:07,522 INFO L225 Difference]: With dead ends: 41331 [2021-01-06 13:39:07,522 INFO L226 Difference]: Without dead ends: 19741 [2021-01-06 13:39:07,534 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:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19741 states. [2021-01-06 13:39:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19741 to 17897. [2021-01-06 13:39:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17897 states. [2021-01-06 13:39:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17897 states to 17897 states and 19159 transitions. [2021-01-06 13:39:07,717 INFO L78 Accepts]: Start accepts. Automaton has 17897 states and 19159 transitions. Word has length 845 [2021-01-06 13:39:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:07,718 INFO L481 AbstractCegarLoop]: Abstraction has 17897 states and 19159 transitions. [2021-01-06 13:39:07,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17897 states and 19159 transitions. [2021-01-06 13:39:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2021-01-06 13:39:07,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:07,734 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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:07,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 13:39:07,735 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash -674512410, now seen corresponding path program 1 times [2021-01-06 13:39:07,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:07,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448138149] [2021-01-06 13:39:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 1251 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2021-01-06 13:39:08,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448138149] [2021-01-06 13:39:08,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:08,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:39:08,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183373412] [2021-01-06 13:39:08,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:08,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:08,645 INFO L87 Difference]: Start difference. First operand 17897 states and 19159 transitions. Second operand 3 states. [2021-01-06 13:39:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:09,320 INFO L93 Difference]: Finished difference Result 35423 states and 37935 transitions. [2021-01-06 13:39:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:09,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 868 [2021-01-06 13:39:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:09,336 INFO L225 Difference]: With dead ends: 35423 [2021-01-06 13:39:09,336 INFO L226 Difference]: Without dead ends: 17896 [2021-01-06 13:39:09,344 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:39:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17896 states. [2021-01-06 13:39:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17896 to 17896. [2021-01-06 13:39:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17896 states. [2021-01-06 13:39:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17896 states to 17896 states and 19157 transitions. [2021-01-06 13:39:09,507 INFO L78 Accepts]: Start accepts. Automaton has 17896 states and 19157 transitions. Word has length 868 [2021-01-06 13:39:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:09,507 INFO L481 AbstractCegarLoop]: Abstraction has 17896 states and 19157 transitions. [2021-01-06 13:39:09,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 17896 states and 19157 transitions. [2021-01-06 13:39:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2021-01-06 13:39:09,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:09,525 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:39:09,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 13:39:09,525 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:09,526 INFO L82 PathProgramCache]: Analyzing trace with hash 327083931, now seen corresponding path program 1 times [2021-01-06 13:39:09,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:09,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559140995] [2021-01-06 13:39:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 2398 proven. 0 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2021-01-06 13:39:10,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559140995] [2021-01-06 13:39:10,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:10,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:39:10,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464360367] [2021-01-06 13:39:10,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:39:10,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:39:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:39:10,592 INFO L87 Difference]: Start difference. First operand 17896 states and 19157 transitions. Second operand 4 states. [2021-01-06 13:39:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:12,807 INFO L93 Difference]: Finished difference Result 42984 states and 46034 transitions. [2021-01-06 13:39:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:39:12,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 996 [2021-01-06 13:39:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:12,830 INFO L225 Difference]: With dead ends: 42984 [2021-01-06 13:39:12,830 INFO L226 Difference]: Without dead ends: 23986 [2021-01-06 13:39:12,841 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:39:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23986 states. [2021-01-06 13:39:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23986 to 18461. [2021-01-06 13:39:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2021-01-06 13:39:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 19727 transitions. [2021-01-06 13:39:13,038 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 19727 transitions. Word has length 996 [2021-01-06 13:39:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:13,038 INFO L481 AbstractCegarLoop]: Abstraction has 18461 states and 19727 transitions. [2021-01-06 13:39:13,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:39:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 19727 transitions. [2021-01-06 13:39:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2021-01-06 13:39:13,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:13,058 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 13:39:13,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 13:39:13,058 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash -755954434, now seen corresponding path program 1 times [2021-01-06 13:39:13,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:13,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946377828] [2021-01-06 13:39:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3448 backedges. 1542 proven. 0 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2021-01-06 13:39:15,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946377828] [2021-01-06 13:39:15,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:15,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 13:39:15,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637396839] [2021-01-06 13:39:15,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 13:39:15,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:15,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 13:39:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:39:15,146 INFO L87 Difference]: Start difference. First operand 18461 states and 19727 transitions. Second operand 6 states. [2021-01-06 13:39:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:17,909 INFO L93 Difference]: Finished difference Result 43357 states and 46286 transitions. [2021-01-06 13:39:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 13:39:17,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1033 [2021-01-06 13:39:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:17,934 INFO L225 Difference]: With dead ends: 43357 [2021-01-06 13:39:17,934 INFO L226 Difference]: Without dead ends: 25266 [2021-01-06 13:39:17,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:39:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25266 states. [2021-01-06 13:39:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25266 to 19751. [2021-01-06 13:39:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19751 states. [2021-01-06 13:39:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19751 states to 19751 states and 21148 transitions. [2021-01-06 13:39:18,163 INFO L78 Accepts]: Start accepts. Automaton has 19751 states and 21148 transitions. Word has length 1033 [2021-01-06 13:39:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:18,163 INFO L481 AbstractCegarLoop]: Abstraction has 19751 states and 21148 transitions. [2021-01-06 13:39:18,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 13:39:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 19751 states and 21148 transitions. [2021-01-06 13:39:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2021-01-06 13:39:18,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:18,182 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, 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, 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 13:39:18,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 13:39:18,182 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1814583081, now seen corresponding path program 1 times [2021-01-06 13:39:18,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:18,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406589231] [2021-01-06 13:39:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3495 backedges. 1581 proven. 8 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2021-01-06 13:39:20,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406589231] [2021-01-06 13:39:20,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501900276] [2021-01-06 13:39:20,481 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:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:20,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:39:20,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3495 backedges. 1468 proven. 121 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2021-01-06 13:39:22,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:39:22,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2021-01-06 13:39:22,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780614826] [2021-01-06 13:39:22,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:39:22,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:39:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:39:22,746 INFO L87 Difference]: Start difference. First operand 19751 states and 21148 transitions. Second operand 9 states. [2021-01-06 13:39:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:28,561 INFO L93 Difference]: Finished difference Result 46323 states and 49502 transitions. [2021-01-06 13:39:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 13:39:28,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1043 [2021-01-06 13:39:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:28,587 INFO L225 Difference]: With dead ends: 46323 [2021-01-06 13:39:28,588 INFO L226 Difference]: Without dead ends: 26942 [2021-01-06 13:39:28,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1041 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-01-06 13:39:28,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26942 states. [2021-01-06 13:39:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26942 to 25089. [2021-01-06 13:39:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25089 states. [2021-01-06 13:39:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25089 states to 25089 states and 26760 transitions. [2021-01-06 13:39:28,889 INFO L78 Accepts]: Start accepts. Automaton has 25089 states and 26760 transitions. Word has length 1043 [2021-01-06 13:39:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:28,889 INFO L481 AbstractCegarLoop]: Abstraction has 25089 states and 26760 transitions. [2021-01-06 13:39:28,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:39:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states and 26760 transitions. [2021-01-06 13:39:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2021-01-06 13:39:28,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:28,912 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 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:29,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:39:29,120 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash -724287387, now seen corresponding path program 1 times [2021-01-06 13:39:29,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:29,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844811628] [2021-01-06 13:39:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3572 backedges. 1967 proven. 0 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2021-01-06 13:39:30,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844811628] [2021-01-06 13:39:30,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:30,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:30,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599707234] [2021-01-06 13:39:30,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:30,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:30,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:30,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:30,027 INFO L87 Difference]: Start difference. First operand 25089 states and 26760 transitions. Second operand 3 states. [2021-01-06 13:39:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:31,232 INFO L93 Difference]: Finished difference Result 49623 states and 52949 transitions. [2021-01-06 13:39:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:31,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1113 [2021-01-06 13:39:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:31,254 INFO L225 Difference]: With dead ends: 49623 [2021-01-06 13:39:31,254 INFO L226 Difference]: Without dead ends: 24904 [2021-01-06 13:39:31,265 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:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24904 states. [2021-01-06 13:39:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24904 to 24904. [2021-01-06 13:39:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24904 states. [2021-01-06 13:39:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24904 states to 24904 states and 26534 transitions. [2021-01-06 13:39:31,527 INFO L78 Accepts]: Start accepts. Automaton has 24904 states and 26534 transitions. Word has length 1113 [2021-01-06 13:39:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:31,528 INFO L481 AbstractCegarLoop]: Abstraction has 24904 states and 26534 transitions. [2021-01-06 13:39:31,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24904 states and 26534 transitions. [2021-01-06 13:39:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2021-01-06 13:39:31,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:31,553 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 13:39:31,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 13:39:31,553 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1794879253, now seen corresponding path program 1 times [2021-01-06 13:39:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:31,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33437162] [2021-01-06 13:39:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 2278 proven. 429 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-01-06 13:39:33,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33437162] [2021-01-06 13:39:33,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5909927] [2021-01-06 13:39:33,756 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:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:34,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:39:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4086 backedges. 2116 proven. 0 refuted. 0 times theorem prover too weak. 1970 trivial. 0 not checked. [2021-01-06 13:39:35,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:35,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-01-06 13:39:35,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541730517] [2021-01-06 13:39:35,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:35,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:35,807 INFO L87 Difference]: Start difference. First operand 24904 states and 26534 transitions. Second operand 3 states. [2021-01-06 13:39:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:37,023 INFO L93 Difference]: Finished difference Result 50179 states and 53443 transitions. [2021-01-06 13:39:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:37,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1113 [2021-01-06 13:39:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:37,048 INFO L225 Difference]: With dead ends: 50179 [2021-01-06 13:39:37,048 INFO L226 Difference]: Without dead ends: 24357 [2021-01-06 13:39:37,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 1115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24357 states. [2021-01-06 13:39:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24357 to 21040. [2021-01-06 13:39:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21040 states. [2021-01-06 13:39:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21040 states to 21040 states and 22360 transitions. [2021-01-06 13:39:37,518 INFO L78 Accepts]: Start accepts. Automaton has 21040 states and 22360 transitions. Word has length 1113 [2021-01-06 13:39:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:37,518 INFO L481 AbstractCegarLoop]: Abstraction has 21040 states and 22360 transitions. [2021-01-06 13:39:37,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 21040 states and 22360 transitions. [2021-01-06 13:39:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1137 [2021-01-06 13:39:37,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:37,542 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, 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, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 13:39:37,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:39:37,743 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1674929697, now seen corresponding path program 1 times [2021-01-06 13:39:37,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:37,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914921172] [2021-01-06 13:39:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 3066 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2021-01-06 13:39:39,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914921172] [2021-01-06 13:39:39,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:39,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:39:39,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811191360] [2021-01-06 13:39:39,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:39:39,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:39:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:39:39,066 INFO L87 Difference]: Start difference. First operand 21040 states and 22360 transitions. Second operand 4 states. [2021-01-06 13:39:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:41,239 INFO L93 Difference]: Finished difference Result 50010 states and 53111 transitions. [2021-01-06 13:39:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:39:41,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1136 [2021-01-06 13:39:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:41,265 INFO L225 Difference]: With dead ends: 50010 [2021-01-06 13:39:41,266 INFO L226 Difference]: Without dead ends: 28236 [2021-01-06 13:39:41,278 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:39:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28236 states. [2021-01-06 13:39:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28236 to 20304. [2021-01-06 13:39:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20304 states. [2021-01-06 13:39:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20304 states to 20304 states and 21580 transitions. [2021-01-06 13:39:41,540 INFO L78 Accepts]: Start accepts. Automaton has 20304 states and 21580 transitions. Word has length 1136 [2021-01-06 13:39:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:41,541 INFO L481 AbstractCegarLoop]: Abstraction has 20304 states and 21580 transitions. [2021-01-06 13:39:41,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:39:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20304 states and 21580 transitions. [2021-01-06 13:39:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1249 [2021-01-06 13:39:41,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:41,562 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, 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, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 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:41,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 13:39:41,562 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash 95041160, now seen corresponding path program 1 times [2021-01-06 13:39:41,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:41,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495499190] [2021-01-06 13:39:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 2661 proven. 808 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2021-01-06 13:39:44,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495499190] [2021-01-06 13:39:44,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982614566] [2021-01-06 13:39:44,528 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:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:44,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:39:44,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4617 backedges. 2362 proven. 0 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2021-01-06 13:39:46,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:39:46,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2021-01-06 13:39:46,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368050346] [2021-01-06 13:39:46,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:46,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:46,672 INFO L87 Difference]: Start difference. First operand 20304 states and 21580 transitions. Second operand 3 states. [2021-01-06 13:39:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:47,910 INFO L93 Difference]: Finished difference Result 41735 states and 44402 transitions. [2021-01-06 13:39:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:47,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1248 [2021-01-06 13:39:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:47,934 INFO L225 Difference]: With dead ends: 41735 [2021-01-06 13:39:47,934 INFO L226 Difference]: Without dead ends: 21801 [2021-01-06 13:39:47,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1255 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:39:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21801 states. [2021-01-06 13:39:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21801 to 21612. [2021-01-06 13:39:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21612 states. [2021-01-06 13:39:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21612 states to 21612 states and 22968 transitions. [2021-01-06 13:39:48,180 INFO L78 Accepts]: Start accepts. Automaton has 21612 states and 22968 transitions. Word has length 1248 [2021-01-06 13:39:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:48,180 INFO L481 AbstractCegarLoop]: Abstraction has 21612 states and 22968 transitions. [2021-01-06 13:39:48,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 21612 states and 22968 transitions. [2021-01-06 13:39:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2021-01-06 13:39:48,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:48,204 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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:39:48,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 13:39:48,413 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash 759028829, now seen corresponding path program 1 times [2021-01-06 13:39:48,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:48,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881846864] [2021-01-06 13:39:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5981 backedges. 2710 proven. 0 refuted. 0 times theorem prover too weak. 3271 trivial. 0 not checked. [2021-01-06 13:39:49,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881846864] [2021-01-06 13:39:49,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:49,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:39:49,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365178390] [2021-01-06 13:39:49,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:49,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:49,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:49,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:49,809 INFO L87 Difference]: Start difference. First operand 21612 states and 22968 transitions. Second operand 3 states. [2021-01-06 13:39:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:50,520 INFO L93 Difference]: Finished difference Result 41367 states and 43960 transitions. [2021-01-06 13:39:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:50,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1426 [2021-01-06 13:39:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:50,538 INFO L225 Difference]: With dead ends: 41367 [2021-01-06 13:39:50,538 INFO L226 Difference]: Without dead ends: 20125 [2021-01-06 13:39:50,549 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:39:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20125 states. [2021-01-06 13:39:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20125 to 20115. [2021-01-06 13:39:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20115 states. [2021-01-06 13:39:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20115 states to 20115 states and 21342 transitions. [2021-01-06 13:39:50,851 INFO L78 Accepts]: Start accepts. Automaton has 20115 states and 21342 transitions. Word has length 1426 [2021-01-06 13:39:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:50,851 INFO L481 AbstractCegarLoop]: Abstraction has 20115 states and 21342 transitions. [2021-01-06 13:39:50,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20115 states and 21342 transitions. [2021-01-06 13:39:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1451 [2021-01-06 13:39:50,874 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:50,875 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 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:39:50,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 13:39:50,875 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1787522939, now seen corresponding path program 1 times [2021-01-06 13:39:50,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:50,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445909064] [2021-01-06 13:39:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6022 backedges. 3739 proven. 0 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-01-06 13:39:52,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445909064] [2021-01-06 13:39:52,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:39:52,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:39:52,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667917785] [2021-01-06 13:39:52,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:39:52,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:39:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:39:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:39:52,229 INFO L87 Difference]: Start difference. First operand 20115 states and 21342 transitions. Second operand 3 states. [2021-01-06 13:39:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:39:53,533 INFO L93 Difference]: Finished difference Result 37834 states and 40170 transitions. [2021-01-06 13:39:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:39:53,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1450 [2021-01-06 13:39:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:39:53,549 INFO L225 Difference]: With dead ends: 37834 [2021-01-06 13:39:53,549 INFO L226 Difference]: Without dead ends: 18089 [2021-01-06 13:39:53,560 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:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18089 states. [2021-01-06 13:39:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18089 to 16985. [2021-01-06 13:39:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16985 states. [2021-01-06 13:39:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 17916 transitions. [2021-01-06 13:39:53,746 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 17916 transitions. Word has length 1450 [2021-01-06 13:39:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:39:53,747 INFO L481 AbstractCegarLoop]: Abstraction has 16985 states and 17916 transitions. [2021-01-06 13:39:53,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:39:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 17916 transitions. [2021-01-06 13:39:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1657 [2021-01-06 13:39:53,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:39:53,772 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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, 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:53,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 13:39:53,772 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:39:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:39:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1911232197, now seen corresponding path program 1 times [2021-01-06 13:39:53,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:39:53,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608493578] [2021-01-06 13:39:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:39:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 4074 proven. 228 refuted. 0 times theorem prover too weak. 3826 trivial. 0 not checked. [2021-01-06 13:39:57,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608493578] [2021-01-06 13:39:57,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297052869] [2021-01-06 13:39:57,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 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:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:39:57,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 2055 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-06 13:39:57,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:39:59,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:39:59,062 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 13:39:59,067 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 13:40:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 4344 proven. 304 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2021-01-06 13:40:02,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:40:02,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2021-01-06 13:40:02,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598098121] [2021-01-06 13:40:02,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 13:40:02,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 13:40:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:40:02,896 INFO L87 Difference]: Start difference. First operand 16985 states and 17916 transitions. Second operand 10 states. [2021-01-06 13:40:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:08,741 INFO L93 Difference]: Finished difference Result 35381 states and 37295 transitions. [2021-01-06 13:40:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 13:40:08,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1656 [2021-01-06 13:40:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:08,835 INFO L225 Difference]: With dead ends: 35381 [2021-01-06 13:40:08,835 INFO L226 Difference]: Without dead ends: 18582 [2021-01-06 13:40:08,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1671 GetRequests, 1651 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-01-06 13:40:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18582 states. [2021-01-06 13:40:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18582 to 17353. [2021-01-06 13:40:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17353 states. [2021-01-06 13:40:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17353 states to 17353 states and 18277 transitions. [2021-01-06 13:40:09,026 INFO L78 Accepts]: Start accepts. Automaton has 17353 states and 18277 transitions. Word has length 1656 [2021-01-06 13:40:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:09,027 INFO L481 AbstractCegarLoop]: Abstraction has 17353 states and 18277 transitions. [2021-01-06 13:40:09,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 13:40:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17353 states and 18277 transitions. [2021-01-06 13:40:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1770 [2021-01-06 13:40:09,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:40:09,053 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, 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, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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, 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:40:09,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-06 13:40:09,261 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:40:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:40:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash -870530921, now seen corresponding path program 1 times [2021-01-06 13:40:09,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:40:09,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038759507] [2021-01-06 13:40:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:40:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9454 backedges. 5365 proven. 263 refuted. 0 times theorem prover too weak. 3826 trivial. 0 not checked. [2021-01-06 13:40:13,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038759507] [2021-01-06 13:40:13,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53367759] [2021-01-06 13:40:13,548 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:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:40:14,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 2192 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:40:14,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:40:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9454 backedges. 5296 proven. 0 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2021-01-06 13:40:17,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:40:17,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2021-01-06 13:40:17,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490686590] [2021-01-06 13:40:17,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:40:17,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:40:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:40:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:40:17,160 INFO L87 Difference]: Start difference. First operand 17353 states and 18277 transitions. Second operand 4 states. [2021-01-06 13:40:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:40:18,820 INFO L93 Difference]: Finished difference Result 26950 states and 28362 transitions. [2021-01-06 13:40:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:40:18,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1769 [2021-01-06 13:40:18,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:40:18,822 INFO L225 Difference]: With dead ends: 26950 [2021-01-06 13:40:18,822 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 13:40:18,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1774 GetRequests, 1767 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:40:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 13:40:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 13:40:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 13:40:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 13:40:18,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1769 [2021-01-06 13:40:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:40:18,831 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 13:40:18,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:40:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 13:40:18,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 13:40:19,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-06 13:40:19,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 13:40:25,346 WARN L197 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 1642 DAG size of output: 1083 [2021-01-06 13:40:31,449 WARN L197 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 1636 DAG size of output: 1083 [2021-01-06 13:40:48,113 WARN L197 SmtUtils]: Spent 16.65 s on a formula simplification. DAG size of input: 981 DAG size of output: 150 [2021-01-06 13:41:04,945 WARN L197 SmtUtils]: Spent 16.82 s on a formula simplification. DAG size of input: 981 DAG size of output: 150 [2021-01-06 13:41:04,949 INFO L189 CegarLoopUtils]: For program point L498(lines 498 509) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,950 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L103(line 103) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L37(line 37) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,951 INFO L189 CegarLoopUtils]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L172(line 172) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L106(line 106) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L40(line 40) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,952 INFO L189 CegarLoopUtils]: For program point L768(lines 768 778) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L175(line 175) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L109(line 109) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L43(line 43) no Hoare annotation was computed. [2021-01-06 13:41:04,953 INFO L189 CegarLoopUtils]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,954 INFO L189 CegarLoopUtils]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,954 INFO L189 CegarLoopUtils]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,954 INFO L185 CegarLoopUtils]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse28 (+ ~a23~0 43)) (.cse14 (<= 247 ~a29~0)) (.cse15 (<= ~a23~0 138)) (.cse19 (<= 130 ~a29~0)) (.cse2 (= ~a8~0 15)) (.cse11 (= ~a4~0 1)) (.cse5 (= ~a3~0 1))) (let ((.cse16 (<= 312 ~a23~0)) (.cse3 (<= ~a29~0 274)) (.cse8 (<= ~a25~0 9)) (.cse9 (< 306 ~a23~0)) (.cse7 (or (and .cse15 .cse11 .cse14) (and .cse15 .cse19 .cse2 .cse11 .cse5))) (.cse20 (= ~a25~0 11)) (.cse26 (<= ~a29~0 140)) (.cse13 (<= .cse28 0)) (.cse18 (= ~a25~0 10)) (.cse6 (<= (+ ~a23~0 55) 0)) (.cse0 (= ~a4~0 0)) (.cse1 (< 140 ~a29~0)) (.cse22 (<= ~a29~0 245)) (.cse23 (<= ~a23~0 599997)) (.cse25 (<= 0 (+ ~a29~0 580294))) (.cse17 (<= ~a25~0 10)) (.cse24 (<= ~a29~0 130)) (.cse27 (<= ~a23~0 312)) (.cse4 (= ~a25~0 12)) (.cse21 (<= 27009 ~a29~0)) (.cse12 (= ~a25~0 13)) (.cse10 (<= ~a23~0 600000))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse4 .cse10 .cse11 .cse5) (and .cse0 (or (and .cse12 .cse3 .cse13 .cse14) (and .cse8 .cse13 .cse14)) .cse2 .cse5) (and .cse15 .cse8 .cse11 (<= 300138 ~a29~0)) (and (or (and .cse16 .cse17 .cse18 .cse19 .cse3 .cse10 .cse11) (and .cse17 .cse16 .cse8 .cse19 .cse3 .cse10 .cse11)) .cse1 .cse2 .cse5) (and .cse20 .cse15 .cse11) (and .cse21 .cse7 .cse2 .cse5) (and .cse7 .cse1 .cse22 .cse5) (and (<= ~a29~0 275) .cse0 .cse2 .cse4 .cse5 .cse14) (and (or (and .cse16 .cse17 .cse18 .cse1 .cse19 .cse2 .cse3 .cse11) (and .cse17 .cse16 .cse8 .cse1 .cse19 .cse2 .cse3 .cse11)) .cse22 .cse5) (and .cse20 .cse2 .cse10 .cse11 .cse5 .cse14) (and .cse9 .cse12 .cse2 .cse11 .cse23 .cse5) (and .cse0 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse24 .cse2 .cse4 .cse5 .cse25 .cse6) (and .cse0 .cse8 .cse24 .cse2 .cse13 .cse25 .cse5) (and .cse8 .cse26 .cse27 .cse2 .cse11 .cse5) (and .cse20 .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse18) (and .cse18 .cse2 .cse11 .cse5 .cse23) (and .cse12 .cse1 .cse2 .cse10 .cse11 .cse5 (<= ~a29~0 232)) (and (or (and .cse20 (or (and .cse26 (<= (+ ~a23~0 119992) 0)) (and .cse24 .cse13)) .cse25) (and .cse18 .cse24 .cse25 .cse6)) .cse0 .cse2 .cse5) (and .cse12 .cse1 .cse2 .cse22 .cse23 .cse11 .cse5) (and .cse12 .cse24 .cse2 .cse11 .cse23 .cse5 .cse25) (and .cse17 .cse2 .cse10 .cse11 .cse5 .cse14) (and .cse15 .cse24 .cse11) (and .cse27 .cse2 .cse4 (< 0 .cse28) .cse11 .cse5) (and .cse21 .cse12 .cse2 .cse10 .cse11 .cse5)))) [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L705(lines 705 715) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L178(line 178) no Hoare annotation was computed. [2021-01-06 13:41:04,955 INFO L189 CegarLoopUtils]: For program point L112(line 112) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L46(line 46) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L192 CegarLoopUtils]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L181(line 181) no Hoare annotation was computed. [2021-01-06 13:41:04,956 INFO L189 CegarLoopUtils]: For program point L115(line 115) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L49(line 49) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2021-01-06 13:41:04,957 INFO L189 CegarLoopUtils]: For program point L118(line 118) no Hoare annotation was computed. [2021-01-06 13:41:04,958 INFO L189 CegarLoopUtils]: For program point L52(line 52) no Hoare annotation was computed. [2021-01-06 13:41:04,958 INFO L189 CegarLoopUtils]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,958 INFO L185 CegarLoopUtils]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse28 (+ ~a23~0 43)) (.cse14 (<= 247 ~a29~0)) (.cse15 (<= ~a23~0 138)) (.cse19 (<= 130 ~a29~0)) (.cse2 (= ~a8~0 15)) (.cse11 (= ~a4~0 1)) (.cse5 (= ~a3~0 1))) (let ((.cse16 (<= 312 ~a23~0)) (.cse3 (<= ~a29~0 274)) (.cse8 (<= ~a25~0 9)) (.cse9 (< 306 ~a23~0)) (.cse7 (or (and .cse15 .cse11 .cse14) (and .cse15 .cse19 .cse2 .cse11 .cse5))) (.cse20 (= ~a25~0 11)) (.cse26 (<= ~a29~0 140)) (.cse13 (<= .cse28 0)) (.cse18 (= ~a25~0 10)) (.cse6 (<= (+ ~a23~0 55) 0)) (.cse0 (= ~a4~0 0)) (.cse1 (< 140 ~a29~0)) (.cse22 (<= ~a29~0 245)) (.cse23 (<= ~a23~0 599997)) (.cse25 (<= 0 (+ ~a29~0 580294))) (.cse17 (<= ~a25~0 10)) (.cse24 (<= ~a29~0 130)) (.cse27 (<= ~a23~0 312)) (.cse4 (= ~a25~0 12)) (.cse21 (<= 27009 ~a29~0)) (.cse12 (= ~a25~0 13)) (.cse10 (<= ~a23~0 600000))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse4 .cse10 .cse11 .cse5) (and .cse0 (or (and .cse12 .cse3 .cse13 .cse14) (and .cse8 .cse13 .cse14)) .cse2 .cse5) (and .cse15 .cse8 .cse11 (<= 300138 ~a29~0)) (and (or (and .cse16 .cse17 .cse18 .cse19 .cse3 .cse10 .cse11) (and .cse17 .cse16 .cse8 .cse19 .cse3 .cse10 .cse11)) .cse1 .cse2 .cse5) (and .cse20 .cse15 .cse11) (and .cse21 .cse7 .cse2 .cse5) (and .cse7 .cse1 .cse22 .cse5) (and (<= ~a29~0 275) .cse0 .cse2 .cse4 .cse5 .cse14) (and (or (and .cse16 .cse17 .cse18 .cse1 .cse19 .cse2 .cse3 .cse11) (and .cse17 .cse16 .cse8 .cse1 .cse19 .cse2 .cse3 .cse11)) .cse22 .cse5) (and .cse20 .cse2 .cse10 .cse11 .cse5 .cse14) (and .cse9 .cse12 .cse2 .cse11 .cse23 .cse5) (and .cse0 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse24 .cse2 .cse4 .cse5 .cse25 .cse6) (and .cse0 .cse8 .cse24 .cse2 .cse13 .cse25 .cse5) (and .cse8 .cse26 .cse27 .cse2 .cse11 .cse5) (and .cse20 .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse18) (and .cse18 .cse2 .cse11 .cse5 .cse23) (and .cse12 .cse1 .cse2 .cse10 .cse11 .cse5 (<= ~a29~0 232)) (and (or (and .cse20 (or (and .cse26 (<= (+ ~a23~0 119992) 0)) (and .cse24 .cse13)) .cse25) (and .cse18 .cse24 .cse25 .cse6)) .cse0 .cse2 .cse5) (and .cse12 .cse1 .cse2 .cse22 .cse23 .cse11 .cse5) (and .cse12 .cse24 .cse2 .cse11 .cse23 .cse5 .cse25) (and .cse17 .cse2 .cse10 .cse11 .cse5 .cse14) (and .cse15 .cse24 .cse11) (and .cse27 .cse2 .cse4 (< 0 .cse28) .cse11 .cse5) (and .cse21 .cse12 .cse2 .cse10 .cse11 .cse5)))) [2021-01-06 13:41:04,958 INFO L189 CegarLoopUtils]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,958 INFO L189 CegarLoopUtils]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,958 INFO L189 CegarLoopUtils]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L187(line 187) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L121(line 121) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L55(line 55) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L980(lines 980 990) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L914(lines 914 924) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2021-01-06 13:41:04,959 INFO L189 CegarLoopUtils]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L190(line 190) no Hoare annotation was computed. [2021-01-06 13:41:04,960 INFO L189 CegarLoopUtils]: For program point L124(line 124) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L58(line 58) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L1049(line 1049) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L193(line 193) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L127(line 127) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L61(line 61) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,961 INFO L189 CegarLoopUtils]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L525(lines 525 535) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,962 INFO L189 CegarLoopUtils]: For program point L658(lines 658 667) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L196(line 196) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L130(line 130) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L64(line 64) no Hoare annotation was computed. [2021-01-06 13:41:04,963 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L199(line 199) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L133(line 133) no Hoare annotation was computed. [2021-01-06 13:41:04,964 INFO L189 CegarLoopUtils]: For program point L67(line 67) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L926(lines 926 936) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L728(lines 728 740) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L597(lines 597 607) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,965 INFO L189 CegarLoopUtils]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L202(line 202) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L136(line 136) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L70(line 70) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L205(line 205) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L139(line 139) no Hoare annotation was computed. [2021-01-06 13:41:04,966 INFO L189 CegarLoopUtils]: For program point L73(line 73) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L208(line 208) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L142(line 142) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L76(line 76) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,967 INFO L189 CegarLoopUtils]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L409(lines 409 420) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L211(line 211) no Hoare annotation was computed. [2021-01-06 13:41:04,968 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L79(line 79) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L148(line 148) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L82(line 82) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,969 INFO L189 CegarLoopUtils]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L876(lines 876 885) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L151(line 151) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,970 INFO L189 CegarLoopUtils]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L614(lines 614 624) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L154(line 154) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L88(line 88) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L815(lines 815 825) no Hoare annotation was computed. [2021-01-06 13:41:04,971 INFO L189 CegarLoopUtils]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,972 INFO L189 CegarLoopUtils]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,973 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-01-06 13:41:04,973 INFO L189 CegarLoopUtils]: For program point L91(line 91) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L950(lines 950 962) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L488(lines 488 496) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,974 INFO L189 CegarLoopUtils]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,975 INFO L189 CegarLoopUtils]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,975 INFO L189 CegarLoopUtils]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,975 INFO L189 CegarLoopUtils]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L160(line 160) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L94(line 94) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,978 INFO L189 CegarLoopUtils]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L163(line 163) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L33(lines 33 35) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,979 INFO L189 CegarLoopUtils]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2021-01-06 13:41:04,980 INFO L189 CegarLoopUtils]: For program point L166(line 166) no Hoare annotation was computed. [2021-01-06 13:41:04,980 INFO L189 CegarLoopUtils]: For program point L100(line 100) no Hoare annotation was computed. [2021-01-06 13:41:04,980 INFO L189 CegarLoopUtils]: For program point L34(line 34) no Hoare annotation was computed. [2021-01-06 13:41:04,980 INFO L189 CegarLoopUtils]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2021-01-06 13:41:05,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 01:41:05 BoogieIcfgContainer [2021-01-06 13:41:05,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 13:41:05,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 13:41:05,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 13:41:05,061 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 13:41:05,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:37:52" (3/4) ... [2021-01-06 13:41:05,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 13:41:05,109 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 13:41:05,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 13:41:05,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 13:41:05,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 13:41:05,324 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/eca-rers2012/Problem11_label46.c-witness.graphml [2021-01-06 13:41:05,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 13:41:05,326 INFO L168 Benchmark]: Toolchain (without parser) took 196362.45 ms. Allocated memory was 174.1 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 145.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,326 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 174.1 MB. Free memory is still 145.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 13:41:05,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 936.46 ms. Allocated memory is still 174.1 MB. Free memory was 145.6 MB in the beginning and 136.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.01 ms. Allocated memory is still 174.1 MB. Free memory was 136.6 MB in the beginning and 119.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,328 INFO L168 Benchmark]: Boogie Preprocessor took 140.44 ms. Allocated memory is still 174.1 MB. Free memory was 119.9 MB in the beginning and 109.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,328 INFO L168 Benchmark]: RCFGBuilder took 1867.01 ms. Allocated memory was 174.1 MB in the beginning and 211.8 MB in the end (delta: 37.7 MB). Free memory was 109.4 MB in the beginning and 162.6 MB in the end (delta: -53.2 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,328 INFO L168 Benchmark]: TraceAbstraction took 192970.35 ms. Allocated memory was 211.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 162.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,329 INFO L168 Benchmark]: Witness Printer took 263.89 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 27.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2021-01-06 13:41:05,331 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 174.1 MB. Free memory is still 145.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 936.46 ms. Allocated memory is still 174.1 MB. Free memory was 145.6 MB in the beginning and 136.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 32.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 170.01 ms. Allocated memory is still 174.1 MB. Free memory was 136.6 MB in the beginning and 119.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 140.44 ms. Allocated memory is still 174.1 MB. Free memory was 119.9 MB in the beginning and 109.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1867.01 ms. Allocated memory was 174.1 MB in the beginning and 211.8 MB in the end (delta: 37.7 MB). Free memory was 109.4 MB in the beginning and 162.6 MB in the end (delta: -53.2 MB). Peak memory consumption was 78.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 192970.35 ms. Allocated memory was 211.8 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 162.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 8.0 GB. * Witness Printer took 263.89 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 27.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 202]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((a4 == 0 && 140 < a29) && a8 == 15) && a29 <= 274) && a25 == 12) && a3 == 1) && a23 + 55 <= 0) || (((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && a25 <= 9) && a3 == 1)) || ((((((306 < a23 && 140 < a29) && a8 == 15) && a25 == 12) && a23 <= 600000) && a4 == 1) && a3 == 1)) || (((a4 == 0 && ((((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && 247 <= a29) || ((a25 <= 9 && a23 + 43 <= 0) && 247 <= a29))) && a8 == 15) && a3 == 1)) || (((a23 <= 138 && a25 <= 9) && a4 == 1) && 300138 <= a29)) || ((((((((((312 <= a23 && a25 <= 10) && a25 == 10) && 130 <= a29) && a29 <= 274) && a23 <= 600000) && a4 == 1) || ((((((a25 <= 10 && 312 <= a23) && a25 <= 9) && 130 <= a29) && a29 <= 274) && a23 <= 600000) && a4 == 1)) && 140 < a29) && a8 == 15) && a3 == 1)) || ((a25 == 11 && a23 <= 138) && a4 == 1)) || (((27009 <= a29 && (((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1))) && a8 == 15) && a3 == 1)) || ((((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && 140 < a29) && a29 <= 245) && a3 == 1)) || (((((a29 <= 275 && a4 == 0) && a8 == 15) && a25 == 12) && a3 == 1) && 247 <= a29)) || ((((((((((312 <= a23 && a25 <= 10) && a25 == 10) && 140 < a29) && 130 <= a29) && a8 == 15) && a29 <= 274) && a4 == 1) || (((((((a25 <= 10 && 312 <= a23) && a25 <= 9) && 140 < a29) && 130 <= a29) && a8 == 15) && a29 <= 274) && a4 == 1)) && a29 <= 245) && a3 == 1)) || (((((a25 == 11 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && 247 <= a29)) || (((((306 < a23 && a25 == 13) && a8 == 15) && a4 == 1) && a23 <= 599997) && a3 == 1)) || (((((((a4 == 0 && !(6 == input)) && a29 <= 130) && a8 == 15) && a25 == 12) && a3 == 1) && 0 <= a29 + 580294) && a23 + 55 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 <= 130) && a8 == 15) && a23 + 43 <= 0) && 0 <= a29 + 580294) && a3 == 1)) || (((((a25 <= 9 && a29 <= 140) && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1)) || ((((((a25 == 11 && 306 < a23) && 140 < a29) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && a25 == 10)) || ((((a25 == 10 && a8 == 15) && a4 == 1) && a3 == 1) && a23 <= 599997)) || ((((((a25 == 13 && 140 < a29) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && a29 <= 232)) || ((((((a25 == 11 && ((a29 <= 140 && a23 + 119992 <= 0) || (a29 <= 130 && a23 + 43 <= 0))) && 0 <= a29 + 580294) || (((a25 == 10 && a29 <= 130) && 0 <= a29 + 580294) && a23 + 55 <= 0)) && a4 == 0) && a8 == 15) && a3 == 1)) || ((((((a25 == 13 && 140 < a29) && a8 == 15) && a29 <= 245) && a23 <= 599997) && a4 == 1) && a3 == 1)) || ((((((a25 == 13 && a29 <= 130) && a8 == 15) && a4 == 1) && a23 <= 599997) && a3 == 1) && 0 <= a29 + 580294)) || (((((a25 <= 10 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && 247 <= a29)) || ((a23 <= 138 && a29 <= 130) && a4 == 1)) || (((((a23 <= 312 && a8 == 15) && a25 == 12) && 0 < a23 + 43) && a4 == 1) && a3 == 1)) || (((((27009 <= a29 && a25 == 13) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((a4 == 0 && 140 < a29) && a8 == 15) && a29 <= 274) && a25 == 12) && a3 == 1) && a23 + 55 <= 0) || (((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && a25 <= 9) && a3 == 1)) || ((((((306 < a23 && 140 < a29) && a8 == 15) && a25 == 12) && a23 <= 600000) && a4 == 1) && a3 == 1)) || (((a4 == 0 && ((((a25 == 13 && a29 <= 274) && a23 + 43 <= 0) && 247 <= a29) || ((a25 <= 9 && a23 + 43 <= 0) && 247 <= a29))) && a8 == 15) && a3 == 1)) || (((a23 <= 138 && a25 <= 9) && a4 == 1) && 300138 <= a29)) || ((((((((((312 <= a23 && a25 <= 10) && a25 == 10) && 130 <= a29) && a29 <= 274) && a23 <= 600000) && a4 == 1) || ((((((a25 <= 10 && 312 <= a23) && a25 <= 9) && 130 <= a29) && a29 <= 274) && a23 <= 600000) && a4 == 1)) && 140 < a29) && a8 == 15) && a3 == 1)) || ((a25 == 11 && a23 <= 138) && a4 == 1)) || (((27009 <= a29 && (((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1))) && a8 == 15) && a3 == 1)) || ((((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && 140 < a29) && a29 <= 245) && a3 == 1)) || (((((a29 <= 275 && a4 == 0) && a8 == 15) && a25 == 12) && a3 == 1) && 247 <= a29)) || ((((((((((312 <= a23 && a25 <= 10) && a25 == 10) && 140 < a29) && 130 <= a29) && a8 == 15) && a29 <= 274) && a4 == 1) || (((((((a25 <= 10 && 312 <= a23) && a25 <= 9) && 140 < a29) && 130 <= a29) && a8 == 15) && a29 <= 274) && a4 == 1)) && a29 <= 245) && a3 == 1)) || (((((a25 == 11 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && 247 <= a29)) || (((((306 < a23 && a25 == 13) && a8 == 15) && a4 == 1) && a23 <= 599997) && a3 == 1)) || (((((((a4 == 0 && !(6 == input)) && a29 <= 130) && a8 == 15) && a25 == 12) && a3 == 1) && 0 <= a29 + 580294) && a23 + 55 <= 0)) || ((((((a4 == 0 && a25 <= 9) && a29 <= 130) && a8 == 15) && a23 + 43 <= 0) && 0 <= a29 + 580294) && a3 == 1)) || (((((a25 <= 9 && a29 <= 140) && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1)) || ((((((a25 == 11 && 306 < a23) && 140 < a29) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1)) || ((((a23 <= 138 && a4 == 1) && 247 <= a29) || ((((a23 <= 138 && 130 <= a29) && a8 == 15) && a4 == 1) && a3 == 1)) && a25 == 10)) || ((((a25 == 10 && a8 == 15) && a4 == 1) && a3 == 1) && a23 <= 599997)) || ((((((a25 == 13 && 140 < a29) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && a29 <= 232)) || ((((((a25 == 11 && ((a29 <= 140 && a23 + 119992 <= 0) || (a29 <= 130 && a23 + 43 <= 0))) && 0 <= a29 + 580294) || (((a25 == 10 && a29 <= 130) && 0 <= a29 + 580294) && a23 + 55 <= 0)) && a4 == 0) && a8 == 15) && a3 == 1)) || ((((((a25 == 13 && 140 < a29) && a8 == 15) && a29 <= 245) && a23 <= 599997) && a4 == 1) && a3 == 1)) || ((((((a25 == 13 && a29 <= 130) && a8 == 15) && a4 == 1) && a23 <= 599997) && a3 == 1) && 0 <= a29 + 580294)) || (((((a25 <= 10 && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) && 247 <= a29)) || ((a23 <= 138 && a29 <= 130) && a4 == 1)) || (((((a23 <= 312 && a8 == 15) && a25 == 12) && 0 < a23 + 43) && a4 == 1) && a3 == 1)) || (((((27009 <= a29 && a25 == 13) && a8 == 15) && a23 <= 600000) && a4 == 1) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 146.8s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 71.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 45.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6120 SDtfs, 9403 SDslu, 1026 SDs, 0 SdLazy, 32093 SolverSat, 4821 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11099 GetRequests, 10948 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29156occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 71594 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 195 NumberOfFragments, 1447 HoareAnnotationTreeSize, 3 FomulaSimplifications, 23406828 FormulaSimplificationTreeSizeReduction, 12.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 11367604 FormulaSimplificationTreeSizeReductionInter, 33.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 37236 NumberOfCodeBlocks, 37236 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 37184 ConstructedInterpolants, 0 QuantifiedInterpolants, 113409962 SizeOfPredicates, 15 NumberOfNonLiveVariables, 14104 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 52 InterpolantComputations, 36 PerfectInterpolantSequences, 110247/113539 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...