/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/seq-pthread/cs_sync.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:34:32,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:34:32,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:34:32,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:34:32,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:34:32,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:34:32,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:34:32,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:34:32,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:34:32,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:34:32,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:34:32,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:34:32,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:34:32,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:34:32,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:34:32,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:34:32,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:34:32,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:34:32,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:34:32,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:34:32,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:34:32,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:34:32,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:34:32,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:34:32,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:34:32,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:34:32,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:34:32,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:34:32,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:34:32,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:34:32,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:34:32,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:34:32,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:34:32,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:34:32,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:34:32,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:34:32,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:34:32,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:34:32,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:34:32,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:34:32,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:34:32,727 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 21:34:32,783 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:34:32,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:34:32,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:34:32,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:34:32,787 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:34:32,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:34:32,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:34:32,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:34:32,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:34:32,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:34:32,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:34:32,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:34:32,789 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:34:32,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:34:32,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:34:32,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:34:32,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:34:32,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:34:32,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:34:32,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:34:32,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:34:32,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:34:32,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:34:32,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:34:32,792 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:34:32,792 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 21:34:33,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:34:33,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:34:33,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:34:33,324 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:34:33,325 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:34:33,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2021-01-06 21:34:33,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/92dce760b/f4f34511a9f64e30823e6c938eab9fec/FLAG7a822d033 [2021-01-06 21:34:34,179 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:34:34,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2021-01-06 21:34:34,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/92dce760b/f4f34511a9f64e30823e6c938eab9fec/FLAG7a822d033 [2021-01-06 21:34:34,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/92dce760b/f4f34511a9f64e30823e6c938eab9fec [2021-01-06 21:34:34,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:34:34,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:34:34,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:34:34,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:34:34,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:34:34,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:34:34" (1/1) ... [2021-01-06 21:34:34,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cd8263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:34, skipping insertion in model container [2021-01-06 21:34:34,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:34:34" (1/1) ... [2021-01-06 21:34:34,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:34:34,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 21:34:35,042 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/seq-pthread/cs_sync.i[34698,34711] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IdentifierExpression[~j~1,]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~num~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_num~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_m~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_empty~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_cp_full~0,],[IdentifierExpression[~i~0,]]] left hand side expression in assignment: lhs: VariableLHS[~j~2,] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_status~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_cp___CS_thread_lockedon~0,],[IdentifierExpression[~i~0,]]],[IdentifierExpression[~j~2,]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_lockedon~0,GLOBAL],[IntegerLiteral[1]]],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~num~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~m~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~empty~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~full~0,GLOBAL],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_born_round~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[IntegerLiteral[0]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread_allocated~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: ArrayLHS[ArrayLHS[VariableLHS[~__CS_thread_status~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],[IntegerLiteral[2]]] [2021-01-06 21:34:35,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:34:35,244 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 21:34:35,284 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/seq-pthread/cs_sync.i[34698,34711] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~j~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~lock,] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_thread_index~0,GLOBAL],IntegerLiteral[256]]]]] left hand side expression in assignment: address: IdentifierExpression[~id1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#num~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#num~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_num~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_num~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_m~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_m~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_empty~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_empty~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp_full~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp_full~0,],offset],IdentifierExpression[~i~0,]]]] left hand side expression in assignment: lhs: VariableLHS[~j~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_status~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],IdentifierExpression[~i~0,]]],IdentifierExpression[~j~2,]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_cp___CS_thread_lockedon~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[24],IdentifierExpression[~i~0,]]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~j~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~#__CS_thread_lockedon~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#num~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#num~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#m~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#m~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#empty~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#empty~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#full~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#full~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_thread_index~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_born_round~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~__CS_thread~0,GLOBAL],[IntegerLiteral[0]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~#__CS_thread_allocated~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__CS_round~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__CS_ret~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#__CS_thread_status~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[3],BinaryExpression[ARITHMOD,IdentifierExpression[~__CS_round~0,GLOBAL],IntegerLiteral[256]]]]]]] [2021-01-06 21:34:35,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:34:35,597 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:34:35,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35 WrapperNode [2021-01-06 21:34:35,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:34:35,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:34:35,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:34:35,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:34:35,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:35,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:35,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:34:35,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:34:35,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:34:35,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:34:35,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:35,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:35,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:35,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:36,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:36,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:36,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (1/1) ... [2021-01-06 21:34:36,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:34:36,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:34:36,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:34:36,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:34:36,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (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 21:34:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:34:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 21:34:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 21:34:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 21:34:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 21:34:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 21:34:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 21:34:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:34:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:34:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:34:36,641 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:36,647 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:36,695 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:36,696 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:36,788 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:36,789 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 21:34:41,662 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-10: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,662 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-10: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,663 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-11: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,663 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-11: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet33, __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset, __CS_cs_#t~nondet35, __CS_cs_#t~ite36, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet33;havoc __CS_cs_#t~nondet33;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,663 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-12: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,663 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-12: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,664 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-22: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,664 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-23: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,664 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-24: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,664 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-25: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,664 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-26: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,665 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-27: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,665 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-38: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,665 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-38: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,665 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-39: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,665 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-39: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet33, __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset, __CS_cs_#t~nondet35, __CS_cs_#t~ite36, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet33;havoc __CS_cs_#t~nondet33;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,666 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-40: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,666 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-40: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,666 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-66: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,666 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-66: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,666 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-67: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,667 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-67: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet33, __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset, __CS_cs_#t~nondet35, __CS_cs_#t~ite36, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet33;havoc __CS_cs_#t~nondet33;assume_abort_if_not_#in~cond := (if ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,667 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-44: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,667 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-44: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,667 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-68: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2021-01-06 21:34:41,668 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-68: assume !(0 != ~__CS_ret~0 % 256); [2021-01-06 21:34:41,668 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-46: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,668 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-46: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,668 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-48: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,668 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-48: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,669 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-80: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,669 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-50: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,669 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-50: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,669 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-81: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,669 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-82: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,670 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-83: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,670 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-84: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,670 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-85: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,670 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-138: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,670 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-139: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,671 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-140: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,671 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-141: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,671 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-142: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256;call __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset + 24 * (__CS_cs_~k~0 % 256) + 8 * (~__CS_thread_index~0 % 256), 8);assume_abort_if_not_#in~cond := (if __CS_cs_#t~mem34.base == 0 && __CS_cs_#t~mem34.offset == 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; [2021-01-06 21:34:41,671 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L5-143: havoc __CS_cs_#t~mem34.base, __CS_cs_#t~mem34.offset;assume -2147483648 <= __CS_cs_#t~nondet35 && __CS_cs_#t~nondet35 <= 2147483647; [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-156: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-156: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-158: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-158: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-160: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,672 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-160: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,673 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-162: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,673 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-162: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,673 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-30: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,673 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-30: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,673 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-32: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,674 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-33: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,674 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-33: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,674 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-35: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,674 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-36: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,674 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-36: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,675 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-38: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,675 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-268: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,675 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-268: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,675 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-270: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,675 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-270: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-272: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-272: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-274: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-274: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-114: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,676 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-114: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-116: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-117: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-117: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-119: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-120: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,677 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-120: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,678 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-122: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,678 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-198: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,678 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-198: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,678 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-200: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,678 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-201: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,679 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-201: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,679 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-203: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,679 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-204: assume 0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite36 := ~__CS_ret_PREEMPTED~0 % 256; [2021-01-06 21:34:41,679 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-204: assume !(0 != __CS_cs_#t~nondet35 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite36 := ~__CS_ret~0 % 256; [2021-01-06 21:34:41,679 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L804-206: ~__CS_ret~0 := __CS_cs_#t~ite36;havoc __CS_cs_#t~ite36;havoc __CS_cs_#t~nondet35; [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##816: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##817: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##826: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##825: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##476: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,680 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##475: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##135: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume !(0 == assume_abort_if_not_~cond); [2021-01-06 21:34:41,681 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##143: assume 0 == assume_abort_if_not_~cond;assume false; [2021-01-06 21:34:41,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:34:41,701 INFO L299 CfgBuilder]: Removed 670 assume(true) statements. [2021-01-06 21:34:41,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:34:41 BoogieIcfgContainer [2021-01-06 21:34:41,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:34:41,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:34:41,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:34:41,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:34:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:34:34" (1/3) ... [2021-01-06 21:34:41,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d21cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:34:41, skipping insertion in model container [2021-01-06 21:34:41,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:34:35" (2/3) ... [2021-01-06 21:34:41,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d21cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:34:41, skipping insertion in model container [2021-01-06 21:34:41,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:34:41" (3/3) ... [2021-01-06 21:34:41,719 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2021-01-06 21:34:41,757 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:34:41,764 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:34:41,787 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:34:41,836 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:34:41,837 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:34:41,837 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:34:41,837 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:34:41,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:34:41,841 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:34:41,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:34:41,843 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:34:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states. [2021-01-06 21:34:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 21:34:41,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:41,921 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] [2021-01-06 21:34:41,924 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1767597317, now seen corresponding path program 1 times [2021-01-06 21:34:41,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:41,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010985166] [2021-01-06 21:34:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:42,247 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 21:34:42,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010985166] [2021-01-06 21:34:42,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:42,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:34:42,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815974608] [2021-01-06 21:34:42,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:34:42,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:42,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:34:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:34:42,280 INFO L87 Difference]: Start difference. First operand 763 states. Second operand 3 states. [2021-01-06 21:34:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:42,409 INFO L93 Difference]: Finished difference Result 1528 states and 2370 transitions. [2021-01-06 21:34:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:34:42,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2021-01-06 21:34:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:42,436 INFO L225 Difference]: With dead ends: 1528 [2021-01-06 21:34:42,436 INFO L226 Difference]: Without dead ends: 763 [2021-01-06 21:34:42,444 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 21:34:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2021-01-06 21:34:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 760. [2021-01-06 21:34:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2021-01-06 21:34:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 998 transitions. [2021-01-06 21:34:42,575 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 998 transitions. Word has length 32 [2021-01-06 21:34:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:42,575 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 998 transitions. [2021-01-06 21:34:42,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:34:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 998 transitions. [2021-01-06 21:34:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 21:34:42,578 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:42,578 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] [2021-01-06 21:34:42,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:34:42,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash 120502239, now seen corresponding path program 1 times [2021-01-06 21:34:42,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:42,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767031357] [2021-01-06 21:34:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:34:42,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767031357] [2021-01-06 21:34:42,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:42,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:34:42,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359346249] [2021-01-06 21:34:42,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:34:42,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:42,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:34:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:34:42,699 INFO L87 Difference]: Start difference. First operand 760 states and 998 transitions. Second operand 3 states. [2021-01-06 21:34:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:42,739 INFO L93 Difference]: Finished difference Result 1519 states and 1996 transitions. [2021-01-06 21:34:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:34:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2021-01-06 21:34:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:42,745 INFO L225 Difference]: With dead ends: 1519 [2021-01-06 21:34:42,746 INFO L226 Difference]: Without dead ends: 762 [2021-01-06 21:34:42,748 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 21:34:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-01-06 21:34:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 761. [2021-01-06 21:34:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2021-01-06 21:34:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 999 transitions. [2021-01-06 21:34:42,769 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 999 transitions. Word has length 35 [2021-01-06 21:34:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:42,769 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 999 transitions. [2021-01-06 21:34:42,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:34:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 999 transitions. [2021-01-06 21:34:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 21:34:42,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:42,771 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] [2021-01-06 21:34:42,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:34:42,771 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1650351007, now seen corresponding path program 1 times [2021-01-06 21:34:42,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:42,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411643318] [2021-01-06 21:34:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:34:42,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411643318] [2021-01-06 21:34:42,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069139134] [2021-01-06 21:34:42,870 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 21:34:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:43,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 21:34:43,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:34:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:34:43,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:34:43,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 21:34:43,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232085001] [2021-01-06 21:34:43,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:43,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:43,265 INFO L87 Difference]: Start difference. First operand 761 states and 999 transitions. Second operand 5 states. [2021-01-06 21:34:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:43,331 INFO L93 Difference]: Finished difference Result 1522 states and 1999 transitions. [2021-01-06 21:34:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:34:43,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 21:34:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:43,338 INFO L225 Difference]: With dead ends: 1522 [2021-01-06 21:34:43,339 INFO L226 Difference]: Without dead ends: 764 [2021-01-06 21:34:43,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-01-06 21:34:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 763. [2021-01-06 21:34:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2021-01-06 21:34:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1001 transitions. [2021-01-06 21:34:43,370 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1001 transitions. Word has length 37 [2021-01-06 21:34:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:43,370 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1001 transitions. [2021-01-06 21:34:43,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1001 transitions. [2021-01-06 21:34:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 21:34:43,379 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:43,380 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 21:34:43,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 21:34:43,596 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1661696099, now seen corresponding path program 2 times [2021-01-06 21:34:43,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:43,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885953160] [2021-01-06 21:34:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 21:34:43,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885953160] [2021-01-06 21:34:43,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822186539] [2021-01-06 21:34:43,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 21:34:44,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 21:34:44,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 21:34:44,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 21:34:44,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:34:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 21:34:44,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 21:34:44,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2021-01-06 21:34:44,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606336107] [2021-01-06 21:34:44,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:34:44,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:34:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:34:44,207 INFO L87 Difference]: Start difference. First operand 763 states and 1001 transitions. Second operand 5 states. [2021-01-06 21:34:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:45,206 INFO L93 Difference]: Finished difference Result 1425 states and 1872 transitions. [2021-01-06 21:34:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:34:45,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2021-01-06 21:34:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:45,214 INFO L225 Difference]: With dead ends: 1425 [2021-01-06 21:34:45,214 INFO L226 Difference]: Without dead ends: 1346 [2021-01-06 21:34:45,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:34:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-01-06 21:34:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1335. [2021-01-06 21:34:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2021-01-06 21:34:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1738 transitions. [2021-01-06 21:34:45,259 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1738 transitions. Word has length 39 [2021-01-06 21:34:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:45,260 INFO L481 AbstractCegarLoop]: Abstraction has 1335 states and 1738 transitions. [2021-01-06 21:34:45,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:34:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1738 transitions. [2021-01-06 21:34:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 21:34:45,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:45,266 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 21:34:45,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:34:45,481 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash -521614835, now seen corresponding path program 1 times [2021-01-06 21:34:45,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:45,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248188814] [2021-01-06 21:34:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 21:34:45,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248188814] [2021-01-06 21:34:45,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599103491] [2021-01-06 21:34:45,671 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 21:34:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:46,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 21:34:46,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:34:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 21:34:46,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 21:34:46,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-06 21:34:46,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369757986] [2021-01-06 21:34:46,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:34:46,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:34:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:34:46,119 INFO L87 Difference]: Start difference. First operand 1335 states and 1738 transitions. Second operand 7 states. [2021-01-06 21:34:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:46,307 INFO L93 Difference]: Finished difference Result 2678 states and 3488 transitions. [2021-01-06 21:34:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:34:46,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2021-01-06 21:34:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:46,315 INFO L225 Difference]: With dead ends: 2678 [2021-01-06 21:34:46,315 INFO L226 Difference]: Without dead ends: 1346 [2021-01-06 21:34:46,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:34:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-01-06 21:34:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2021-01-06 21:34:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2021-01-06 21:34:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1750 transitions. [2021-01-06 21:34:46,353 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1750 transitions. Word has length 81 [2021-01-06 21:34:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:46,354 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1750 transitions. [2021-01-06 21:34:46,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:34:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1750 transitions. [2021-01-06 21:34:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:34:46,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:46,358 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:34:46,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 21:34:46,575 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash -303981155, now seen corresponding path program 2 times [2021-01-06 21:34:46,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:46,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899066485] [2021-01-06 21:34:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:34:46,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899066485] [2021-01-06 21:34:46,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:46,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:34:46,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856410739] [2021-01-06 21:34:46,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:34:46,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:34:46,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:34:46,966 INFO L87 Difference]: Start difference. First operand 1346 states and 1750 transitions. Second operand 4 states. [2021-01-06 21:34:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:49,296 INFO L93 Difference]: Finished difference Result 2445 states and 3161 transitions. [2021-01-06 21:34:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:34:49,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 21:34:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:49,309 INFO L225 Difference]: With dead ends: 2445 [2021-01-06 21:34:49,310 INFO L226 Difference]: Without dead ends: 2111 [2021-01-06 21:34:49,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2021-01-06 21:34:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1947. [2021-01-06 21:34:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2021-01-06 21:34:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2547 transitions. [2021-01-06 21:34:49,364 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2547 transitions. Word has length 92 [2021-01-06 21:34:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:49,365 INFO L481 AbstractCegarLoop]: Abstraction has 1947 states and 2547 transitions. [2021-01-06 21:34:49,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:34:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2547 transitions. [2021-01-06 21:34:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:34:49,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:49,368 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:34:49,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:34:49,369 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1784930909, now seen corresponding path program 1 times [2021-01-06 21:34:49,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:49,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396115115] [2021-01-06 21:34:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:52,319 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2021-01-06 21:34:52,563 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-01-06 21:34:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:34:52,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396115115] [2021-01-06 21:34:52,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:52,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:34:52,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140951289] [2021-01-06 21:34:52,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:34:52,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:34:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:34:52,675 INFO L87 Difference]: Start difference. First operand 1947 states and 2547 transitions. Second operand 6 states. [2021-01-06 21:34:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:57,057 INFO L93 Difference]: Finished difference Result 2692 states and 3506 transitions. [2021-01-06 21:34:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:34:57,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2021-01-06 21:34:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:57,072 INFO L225 Difference]: With dead ends: 2692 [2021-01-06 21:34:57,073 INFO L226 Difference]: Without dead ends: 2500 [2021-01-06 21:34:57,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:34:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2021-01-06 21:34:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2474. [2021-01-06 21:34:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2021-01-06 21:34:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3225 transitions. [2021-01-06 21:34:57,163 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3225 transitions. Word has length 92 [2021-01-06 21:34:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:57,164 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 3225 transitions. [2021-01-06 21:34:57,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:34:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3225 transitions. [2021-01-06 21:34:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:34:57,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:57,170 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:34:57,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:34:57,170 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 201854813, now seen corresponding path program 1 times [2021-01-06 21:34:57,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:57,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011771225] [2021-01-06 21:34:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:34:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:34:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:34:57,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011771225] [2021-01-06 21:34:57,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:34:57,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:34:57,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033414434] [2021-01-06 21:34:57,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:34:57,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:34:57,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:34:57,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:34:57,353 INFO L87 Difference]: Start difference. First operand 2474 states and 3225 transitions. Second operand 4 states. [2021-01-06 21:34:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:34:59,622 INFO L93 Difference]: Finished difference Result 3249 states and 4198 transitions. [2021-01-06 21:34:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:34:59,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 21:34:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:34:59,635 INFO L225 Difference]: With dead ends: 3249 [2021-01-06 21:34:59,635 INFO L226 Difference]: Without dead ends: 2121 [2021-01-06 21:34:59,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:34:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2021-01-06 21:34:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1951. [2021-01-06 21:34:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2021-01-06 21:34:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2541 transitions. [2021-01-06 21:34:59,698 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2541 transitions. Word has length 92 [2021-01-06 21:34:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:34:59,698 INFO L481 AbstractCegarLoop]: Abstraction has 1951 states and 2541 transitions. [2021-01-06 21:34:59,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:34:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2541 transitions. [2021-01-06 21:34:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:34:59,702 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:34:59,702 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:34:59,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:34:59,703 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:34:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:34:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1775712547, now seen corresponding path program 1 times [2021-01-06 21:34:59,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:34:59,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630771248] [2021-01-06 21:34:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:02,466 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2021-01-06 21:35:02,699 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2021-01-06 21:35:03,148 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2021-01-06 21:35:03,343 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-01-06 21:35:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:35:03,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630771248] [2021-01-06 21:35:03,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:03,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:35:03,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906897529] [2021-01-06 21:35:03,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:35:03,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:35:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:35:03,460 INFO L87 Difference]: Start difference. First operand 1951 states and 2541 transitions. Second operand 6 states. [2021-01-06 21:35:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:07,569 INFO L93 Difference]: Finished difference Result 2249 states and 2907 transitions. [2021-01-06 21:35:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:35:07,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2021-01-06 21:35:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:07,584 INFO L225 Difference]: With dead ends: 2249 [2021-01-06 21:35:07,584 INFO L226 Difference]: Without dead ends: 1811 [2021-01-06 21:35:07,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 12 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:35:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2021-01-06 21:35:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1787. [2021-01-06 21:35:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2021-01-06 21:35:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2314 transitions. [2021-01-06 21:35:07,634 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2314 transitions. Word has length 92 [2021-01-06 21:35:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:07,634 INFO L481 AbstractCegarLoop]: Abstraction has 1787 states and 2314 transitions. [2021-01-06 21:35:07,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:35:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2314 transitions. [2021-01-06 21:35:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:35:07,637 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:07,638 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:35:07,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:35:07,638 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1342921059, now seen corresponding path program 1 times [2021-01-06 21:35:07,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:07,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216022333] [2021-01-06 21:35:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:35:07,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216022333] [2021-01-06 21:35:07,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:07,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:35:07,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594804765] [2021-01-06 21:35:07,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:35:07,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:35:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:35:07,819 INFO L87 Difference]: Start difference. First operand 1787 states and 2314 transitions. Second operand 4 states. [2021-01-06 21:35:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:08,034 INFO L93 Difference]: Finished difference Result 2301 states and 2941 transitions. [2021-01-06 21:35:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:35:08,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 21:35:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:08,048 INFO L225 Difference]: With dead ends: 2301 [2021-01-06 21:35:08,048 INFO L226 Difference]: Without dead ends: 1790 [2021-01-06 21:35:08,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:35:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2021-01-06 21:35:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1585. [2021-01-06 21:35:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2021-01-06 21:35:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2052 transitions. [2021-01-06 21:35:08,099 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2052 transitions. Word has length 92 [2021-01-06 21:35:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:08,099 INFO L481 AbstractCegarLoop]: Abstraction has 1585 states and 2052 transitions. [2021-01-06 21:35:08,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:35:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2052 transitions. [2021-01-06 21:35:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:35:08,102 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:08,102 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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 21:35:08,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:35:08,102 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:08,103 INFO L82 PathProgramCache]: Analyzing trace with hash 410880155, now seen corresponding path program 1 times [2021-01-06 21:35:08,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:08,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700474389] [2021-01-06 21:35:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:35:08,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700474389] [2021-01-06 21:35:08,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:08,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:35:08,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838455213] [2021-01-06 21:35:08,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:35:08,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:35:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:35:08,203 INFO L87 Difference]: Start difference. First operand 1585 states and 2052 transitions. Second operand 4 states. [2021-01-06 21:35:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:08,397 INFO L93 Difference]: Finished difference Result 2092 states and 2671 transitions. [2021-01-06 21:35:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:35:08,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 21:35:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:08,408 INFO L225 Difference]: With dead ends: 2092 [2021-01-06 21:35:08,408 INFO L226 Difference]: Without dead ends: 1580 [2021-01-06 21:35:08,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:35:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-01-06 21:35:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1375. [2021-01-06 21:35:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2021-01-06 21:35:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1781 transitions. [2021-01-06 21:35:08,460 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1781 transitions. Word has length 92 [2021-01-06 21:35:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:08,460 INFO L481 AbstractCegarLoop]: Abstraction has 1375 states and 1781 transitions. [2021-01-06 21:35:08,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:35:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1781 transitions. [2021-01-06 21:35:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:35:08,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:08,467 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:08,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:35:08,468 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1417338593, now seen corresponding path program 1 times [2021-01-06 21:35:08,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:08,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542047029] [2021-01-06 21:35:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:08,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542047029] [2021-01-06 21:35:08,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:08,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:35:08,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274988911] [2021-01-06 21:35:08,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:35:08,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:35:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:35:08,732 INFO L87 Difference]: Start difference. First operand 1375 states and 1781 transitions. Second operand 3 states. [2021-01-06 21:35:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:09,180 INFO L93 Difference]: Finished difference Result 2414 states and 3130 transitions. [2021-01-06 21:35:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:35:09,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 21:35:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:09,188 INFO L225 Difference]: With dead ends: 2414 [2021-01-06 21:35:09,188 INFO L226 Difference]: Without dead ends: 1111 [2021-01-06 21:35:09,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 21:35:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-01-06 21:35:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2021-01-06 21:35:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2021-01-06 21:35:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1432 transitions. [2021-01-06 21:35:09,221 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1432 transitions. Word has length 120 [2021-01-06 21:35:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:09,221 INFO L481 AbstractCegarLoop]: Abstraction has 1111 states and 1432 transitions. [2021-01-06 21:35:09,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:35:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1432 transitions. [2021-01-06 21:35:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:35:09,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:09,224 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:09,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:35:09,225 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1851067679, now seen corresponding path program 1 times [2021-01-06 21:35:09,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:09,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842856442] [2021-01-06 21:35:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:09,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842856442] [2021-01-06 21:35:09,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:09,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:35:09,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407603749] [2021-01-06 21:35:09,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:35:09,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:35:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:35:09,443 INFO L87 Difference]: Start difference. First operand 1111 states and 1432 transitions. Second operand 4 states. [2021-01-06 21:35:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:10,166 INFO L93 Difference]: Finished difference Result 2778 states and 3582 transitions. [2021-01-06 21:35:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:35:10,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 21:35:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:10,176 INFO L225 Difference]: With dead ends: 2778 [2021-01-06 21:35:10,176 INFO L226 Difference]: Without dead ends: 1739 [2021-01-06 21:35:10,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:35:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-01-06 21:35:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1483. [2021-01-06 21:35:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2021-01-06 21:35:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1911 transitions. [2021-01-06 21:35:10,230 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1911 transitions. Word has length 120 [2021-01-06 21:35:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:10,232 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1911 transitions. [2021-01-06 21:35:10,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:35:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1911 transitions. [2021-01-06 21:35:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:35:10,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:10,237 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:10,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:35:10,237 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1835548961, now seen corresponding path program 1 times [2021-01-06 21:35:10,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:10,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984441113] [2021-01-06 21:35:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:11,755 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-01-06 21:35:11,915 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-01-06 21:35:12,107 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-01-06 21:35:12,279 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2021-01-06 21:35:12,430 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2021-01-06 21:35:12,587 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2021-01-06 21:35:12,739 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2021-01-06 21:35:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:13,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984441113] [2021-01-06 21:35:13,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:13,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 21:35:13,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121557323] [2021-01-06 21:35:13,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 21:35:13,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 21:35:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-01-06 21:35:13,101 INFO L87 Difference]: Start difference. First operand 1483 states and 1911 transitions. Second operand 12 states. [2021-01-06 21:35:13,308 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2021-01-06 21:35:15,764 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-01-06 21:35:16,273 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2021-01-06 21:35:16,556 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2021-01-06 21:35:16,833 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2021-01-06 21:35:17,255 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2021-01-06 21:35:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:23,923 INFO L93 Difference]: Finished difference Result 2908 states and 3756 transitions. [2021-01-06 21:35:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:35:23,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2021-01-06 21:35:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:23,935 INFO L225 Difference]: With dead ends: 2908 [2021-01-06 21:35:23,935 INFO L226 Difference]: Without dead ends: 2355 [2021-01-06 21:35:23,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:35:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2021-01-06 21:35:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1495. [2021-01-06 21:35:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2021-01-06 21:35:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1926 transitions. [2021-01-06 21:35:24,002 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1926 transitions. Word has length 120 [2021-01-06 21:35:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:24,003 INFO L481 AbstractCegarLoop]: Abstraction has 1495 states and 1926 transitions. [2021-01-06 21:35:24,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 21:35:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1926 transitions. [2021-01-06 21:35:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:35:24,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:24,007 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:24,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:35:24,007 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash -921078305, now seen corresponding path program 1 times [2021-01-06 21:35:24,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:24,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186007039] [2021-01-06 21:35:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:25,062 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-01-06 21:35:25,257 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2021-01-06 21:35:25,502 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-06 21:35:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:25,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186007039] [2021-01-06 21:35:25,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:25,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:35:25,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280839695] [2021-01-06 21:35:25,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:35:25,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:35:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:35:25,761 INFO L87 Difference]: Start difference. First operand 1495 states and 1926 transitions. Second operand 10 states. [2021-01-06 21:35:28,220 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2021-01-06 21:35:28,454 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2021-01-06 21:35:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:31,290 INFO L93 Difference]: Finished difference Result 2826 states and 3644 transitions. [2021-01-06 21:35:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 21:35:31,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2021-01-06 21:35:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:31,300 INFO L225 Difference]: With dead ends: 2826 [2021-01-06 21:35:31,300 INFO L226 Difference]: Without dead ends: 2273 [2021-01-06 21:35:31,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:35:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2021-01-06 21:35:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1483. [2021-01-06 21:35:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2021-01-06 21:35:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1910 transitions. [2021-01-06 21:35:31,361 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1910 transitions. Word has length 120 [2021-01-06 21:35:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:31,362 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1910 transitions. [2021-01-06 21:35:31,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:35:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1910 transitions. [2021-01-06 21:35:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 21:35:31,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:31,366 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:31,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:35:31,366 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1071723917, now seen corresponding path program 1 times [2021-01-06 21:35:31,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:31,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494390435] [2021-01-06 21:35:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:31,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494390435] [2021-01-06 21:35:31,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:31,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:35:31,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123087758] [2021-01-06 21:35:31,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:35:31,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:31,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:35:31,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:35:31,497 INFO L87 Difference]: Start difference. First operand 1483 states and 1910 transitions. Second operand 3 states. [2021-01-06 21:35:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:31,633 INFO L93 Difference]: Finished difference Result 2522 states and 3265 transitions. [2021-01-06 21:35:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:35:31,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2021-01-06 21:35:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:31,641 INFO L225 Difference]: With dead ends: 2522 [2021-01-06 21:35:31,641 INFO L226 Difference]: Without dead ends: 1494 [2021-01-06 21:35:31,643 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 21:35:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-01-06 21:35:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2021-01-06 21:35:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2021-01-06 21:35:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1921 transitions. [2021-01-06 21:35:31,696 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1921 transitions. Word has length 123 [2021-01-06 21:35:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:31,696 INFO L481 AbstractCegarLoop]: Abstraction has 1494 states and 1921 transitions. [2021-01-06 21:35:31,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:35:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1921 transitions. [2021-01-06 21:35:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 21:35:31,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:31,700 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:31,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:35:31,700 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1319870411, now seen corresponding path program 1 times [2021-01-06 21:35:31,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:31,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858783026] [2021-01-06 21:35:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:34,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858783026] [2021-01-06 21:35:34,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:34,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:35:34,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614703147] [2021-01-06 21:35:34,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:35:34,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:35:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:35:34,881 INFO L87 Difference]: Start difference. First operand 1494 states and 1921 transitions. Second operand 5 states. [2021-01-06 21:35:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:37,051 INFO L93 Difference]: Finished difference Result 3712 states and 4750 transitions. [2021-01-06 21:35:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:35:37,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2021-01-06 21:35:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:37,062 INFO L225 Difference]: With dead ends: 3712 [2021-01-06 21:35:37,063 INFO L226 Difference]: Without dead ends: 2181 [2021-01-06 21:35:37,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:35:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2021-01-06 21:35:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1722. [2021-01-06 21:35:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2021-01-06 21:35:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2119 transitions. [2021-01-06 21:35:37,130 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2119 transitions. Word has length 123 [2021-01-06 21:35:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:37,130 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 2119 transitions. [2021-01-06 21:35:37,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:35:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2119 transitions. [2021-01-06 21:35:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 21:35:37,134 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:37,134 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:37,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:35:37,134 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash 571351879, now seen corresponding path program 1 times [2021-01-06 21:35:37,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:37,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827598699] [2021-01-06 21:35:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:41,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827598699] [2021-01-06 21:35:41,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:41,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:35:41,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936278898] [2021-01-06 21:35:41,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:35:41,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:35:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:35:41,301 INFO L87 Difference]: Start difference. First operand 1722 states and 2119 transitions. Second operand 10 states. [2021-01-06 21:35:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:35:53,773 INFO L93 Difference]: Finished difference Result 2812 states and 3432 transitions. [2021-01-06 21:35:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:35:53,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2021-01-06 21:35:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:35:53,781 INFO L225 Difference]: With dead ends: 2812 [2021-01-06 21:35:53,781 INFO L226 Difference]: Without dead ends: 2144 [2021-01-06 21:35:53,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:35:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2021-01-06 21:35:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1948. [2021-01-06 21:35:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2021-01-06 21:35:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2389 transitions. [2021-01-06 21:35:53,855 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2389 transitions. Word has length 123 [2021-01-06 21:35:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:35:53,856 INFO L481 AbstractCegarLoop]: Abstraction has 1948 states and 2389 transitions. [2021-01-06 21:35:53,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:35:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2389 transitions. [2021-01-06 21:35:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 21:35:53,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:35:53,861 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:35:53,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:35:53,861 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:35:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:35:53,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1950644145, now seen corresponding path program 1 times [2021-01-06 21:35:53,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:35:53,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928100004] [2021-01-06 21:35:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:35:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:35:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:35:54,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928100004] [2021-01-06 21:35:54,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:35:54,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 21:35:54,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979914765] [2021-01-06 21:35:54,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 21:35:54,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:35:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 21:35:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:35:54,823 INFO L87 Difference]: Start difference. First operand 1948 states and 2389 transitions. Second operand 7 states. [2021-01-06 21:36:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:02,088 INFO L93 Difference]: Finished difference Result 3111 states and 3770 transitions. [2021-01-06 21:36:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:36:02,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2021-01-06 21:36:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:02,096 INFO L225 Difference]: With dead ends: 3111 [2021-01-06 21:36:02,096 INFO L226 Difference]: Without dead ends: 2786 [2021-01-06 21:36:02,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:36:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2021-01-06 21:36:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1969. [2021-01-06 21:36:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 21:36:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2431 transitions. [2021-01-06 21:36:02,179 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2431 transitions. Word has length 135 [2021-01-06 21:36:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:02,180 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 2431 transitions. [2021-01-06 21:36:02,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 21:36:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2431 transitions. [2021-01-06 21:36:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 21:36:02,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:02,185 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:02,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:36:02,185 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash 490381273, now seen corresponding path program 1 times [2021-01-06 21:36:02,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:02,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300539442] [2021-01-06 21:36:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:07,936 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-06 21:36:08,150 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-01-06 21:36:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:36:08,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300539442] [2021-01-06 21:36:08,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:08,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 21:36:08,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39585660] [2021-01-06 21:36:08,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 21:36:08,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 21:36:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:36:08,731 INFO L87 Difference]: Start difference. First operand 1969 states and 2431 transitions. Second operand 14 states. [2021-01-06 21:36:11,241 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-01-06 21:36:13,526 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-01-06 21:36:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:14,598 INFO L93 Difference]: Finished difference Result 3174 states and 3838 transitions. [2021-01-06 21:36:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 21:36:14,599 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2021-01-06 21:36:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:14,607 INFO L225 Difference]: With dead ends: 3174 [2021-01-06 21:36:14,607 INFO L226 Difference]: Without dead ends: 2800 [2021-01-06 21:36:14,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2021-01-06 21:36:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2021-01-06 21:36:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 1895. [2021-01-06 21:36:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2021-01-06 21:36:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2345 transitions. [2021-01-06 21:36:14,703 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2345 transitions. Word has length 136 [2021-01-06 21:36:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:14,704 INFO L481 AbstractCegarLoop]: Abstraction has 1895 states and 2345 transitions. [2021-01-06 21:36:14,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 21:36:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2345 transitions. [2021-01-06 21:36:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 21:36:14,708 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:14,708 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:14,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:36:14,708 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1262141787, now seen corresponding path program 1 times [2021-01-06 21:36:14,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:14,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921764080] [2021-01-06 21:36:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:17,904 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2021-01-06 21:36:18,132 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2021-01-06 21:36:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:36:18,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921764080] [2021-01-06 21:36:18,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:18,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:36:18,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472514539] [2021-01-06 21:36:18,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 21:36:18,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 21:36:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:36:18,452 INFO L87 Difference]: Start difference. First operand 1895 states and 2345 transitions. Second operand 11 states. [2021-01-06 21:36:31,258 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2021-01-06 21:36:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:33,225 INFO L93 Difference]: Finished difference Result 2511 states and 3066 transitions. [2021-01-06 21:36:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:36:33,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2021-01-06 21:36:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:33,230 INFO L225 Difference]: With dead ends: 2511 [2021-01-06 21:36:33,230 INFO L226 Difference]: Without dead ends: 2349 [2021-01-06 21:36:33,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:36:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-01-06 21:36:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1893. [2021-01-06 21:36:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2021-01-06 21:36:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2340 transitions. [2021-01-06 21:36:33,323 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2340 transitions. Word has length 136 [2021-01-06 21:36:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:33,323 INFO L481 AbstractCegarLoop]: Abstraction has 1893 states and 2340 transitions. [2021-01-06 21:36:33,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 21:36:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2340 transitions. [2021-01-06 21:36:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 21:36:33,326 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:33,327 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:33,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:36:33,327 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -398202993, now seen corresponding path program 1 times [2021-01-06 21:36:33,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:33,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524698755] [2021-01-06 21:36:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:36:34,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524698755] [2021-01-06 21:36:34,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:34,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:36:34,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868375751] [2021-01-06 21:36:34,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:36:34,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:34,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:36:34,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:36:34,184 INFO L87 Difference]: Start difference. First operand 1893 states and 2340 transitions. Second operand 6 states. [2021-01-06 21:36:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:37,178 INFO L93 Difference]: Finished difference Result 2239 states and 2738 transitions. [2021-01-06 21:36:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:36:37,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2021-01-06 21:36:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:37,183 INFO L225 Difference]: With dead ends: 2239 [2021-01-06 21:36:37,184 INFO L226 Difference]: Without dead ends: 1930 [2021-01-06 21:36:37,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:36:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2021-01-06 21:36:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1752. [2021-01-06 21:36:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2021-01-06 21:36:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2161 transitions. [2021-01-06 21:36:37,263 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2161 transitions. Word has length 144 [2021-01-06 21:36:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:37,263 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 2161 transitions. [2021-01-06 21:36:37,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:36:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2161 transitions. [2021-01-06 21:36:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 21:36:37,267 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:37,267 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:37,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 21:36:37,267 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:37,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1021803665, now seen corresponding path program 1 times [2021-01-06 21:36:37,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:37,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353392504] [2021-01-06 21:36:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:36:39,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353392504] [2021-01-06 21:36:39,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:39,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:36:39,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387954862] [2021-01-06 21:36:39,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:36:39,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:36:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:36:39,266 INFO L87 Difference]: Start difference. First operand 1752 states and 2161 transitions. Second operand 6 states. [2021-01-06 21:36:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:41,548 INFO L93 Difference]: Finished difference Result 3628 states and 4457 transitions. [2021-01-06 21:36:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:36:41,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2021-01-06 21:36:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:41,552 INFO L225 Difference]: With dead ends: 3628 [2021-01-06 21:36:41,552 INFO L226 Difference]: Without dead ends: 2054 [2021-01-06 21:36:41,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:36:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2021-01-06 21:36:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1869. [2021-01-06 21:36:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2021-01-06 21:36:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2283 transitions. [2021-01-06 21:36:41,643 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2283 transitions. Word has length 144 [2021-01-06 21:36:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:41,643 INFO L481 AbstractCegarLoop]: Abstraction has 1869 states and 2283 transitions. [2021-01-06 21:36:41,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:36:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2283 transitions. [2021-01-06 21:36:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 21:36:41,647 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:41,647 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:41,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 21:36:41,647 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2087716967, now seen corresponding path program 1 times [2021-01-06 21:36:41,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:41,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4868591] [2021-01-06 21:36:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-01-06 21:36:43,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4868591] [2021-01-06 21:36:43,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:36:43,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:36:43,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030807612] [2021-01-06 21:36:43,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:36:43,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:36:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:36:43,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:36:43,787 INFO L87 Difference]: Start difference. First operand 1869 states and 2283 transitions. Second operand 4 states. [2021-01-06 21:36:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:36:45,925 INFO L93 Difference]: Finished difference Result 3689 states and 4488 transitions. [2021-01-06 21:36:45,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:36:45,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2021-01-06 21:36:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:36:45,935 INFO L225 Difference]: With dead ends: 3689 [2021-01-06 21:36:45,935 INFO L226 Difference]: Without dead ends: 2036 [2021-01-06 21:36:45,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:36:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2021-01-06 21:36:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1992. [2021-01-06 21:36:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2021-01-06 21:36:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2406 transitions. [2021-01-06 21:36:46,068 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2406 transitions. Word has length 145 [2021-01-06 21:36:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:36:46,069 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2406 transitions. [2021-01-06 21:36:46,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:36:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2406 transitions. [2021-01-06 21:36:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 21:36:46,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:36:46,073 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:36:46,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 21:36:46,074 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:36:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:36:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1182405927, now seen corresponding path program 1 times [2021-01-06 21:36:46,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:36:46,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833776937] [2021-01-06 21:36:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:36:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:36:57,719 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2021-01-06 21:36:58,188 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 86 [2021-01-06 21:36:58,720 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 99 [2021-01-06 21:36:59,268 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 100 [2021-01-06 21:36:59,927 WARN L197 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 102 [2021-01-06 21:37:00,636 WARN L197 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 104 [2021-01-06 21:37:01,246 WARN L197 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 90 [2021-01-06 21:37:01,846 WARN L197 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 97 [2021-01-06 21:37:02,718 WARN L197 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 111 [2021-01-06 21:37:03,359 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 105 [2021-01-06 21:37:04,081 WARN L197 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 115 [2021-01-06 21:37:04,761 WARN L197 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 108 [2021-01-06 21:37:05,410 WARN L197 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 99 [2021-01-06 21:37:06,144 WARN L197 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 108 [2021-01-06 21:37:06,790 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 106 [2021-01-06 21:37:07,561 WARN L197 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 98 [2021-01-06 21:37:08,465 WARN L197 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 109 [2021-01-06 21:37:09,500 WARN L197 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 115 [2021-01-06 21:37:10,478 WARN L197 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2021-01-06 21:37:11,202 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2021-01-06 21:37:11,798 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2021-01-06 21:37:12,252 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-01-06 21:37:12,582 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-01-06 21:37:12,930 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2021-01-06 21:37:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-01-06 21:37:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833776937] [2021-01-06 21:37:13,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684310974] [2021-01-06 21:37:13,652 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 21:37:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:37:35,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 89 conjunts are in the unsatisfiable core [2021-01-06 21:37:35,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 21:37:36,217 WARN L197 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 76 [2021-01-06 21:37:36,218 INFO L348 Elim1Store]: treesize reduction 1179, result has 10.6 percent of original size [2021-01-06 21:37:36,219 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 4172 treesize of output 4238 [2021-01-06 21:37:36,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:36,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:36,258 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 21:37:36,260 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 21:37:36,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:36,265 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 21:37:36,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:36,318 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:36,903 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 118 [2021-01-06 21:37:36,904 INFO L625 ElimStorePlain]: treesize reduction 582, result has 27.1 percent of original size [2021-01-06 21:37:36,920 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,927 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,933 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,938 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 16 disjuncts [2021-01-06 21:37:36,947 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-06 21:37:36,947 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:168, output treesize:216 [2021-01-06 21:37:36,958 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,963 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,968 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:36,971 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 16 disjuncts [2021-01-06 21:37:37,277 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-01-06 21:37:37,321 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:37,331 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:37,340 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2021-01-06 21:37:37,356 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 14 disjuncts [2021-01-06 21:37:37,371 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 26 disjuncts [2021-01-06 21:37:37,841 INFO L244 Elim1Store]: Index analysis took 311 ms [2021-01-06 21:37:41,451 WARN L197 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:37:41,454 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:37:41,455 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:37:41,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:41,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:41,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:41,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:41,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:41,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:41,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:41,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:41,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:41,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:41,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:41,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:41,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:41,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:41,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:41,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:41,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:41,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:41,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:41,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:41,526 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:41,891 INFO L244 Elim1Store]: Index analysis took 335 ms [2021-01-06 21:37:45,454 WARN L197 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:37:45,455 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:37:45,456 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:37:45,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:45,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:45,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:45,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:45,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:45,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:45,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:45,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:45,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:45,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:45,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:45,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:45,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:45,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:45,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:45,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:45,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:45,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:45,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:45,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:45,527 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:45,962 INFO L244 Elim1Store]: Index analysis took 400 ms [2021-01-06 21:37:49,629 WARN L197 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:37:49,630 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:37:49,631 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:37:49,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:49,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:49,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:49,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:49,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:49,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:49,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:49,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:49,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:49,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:49,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:49,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:49,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:49,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:49,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:49,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:49,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:49,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:49,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:49,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:49,700 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:50,130 INFO L244 Elim1Store]: Index analysis took 396 ms [2021-01-06 21:37:53,738 WARN L197 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:37:53,739 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:37:53,740 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:37:53,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:53,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:53,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:53,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:53,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:53,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:53,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:53,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:53,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:53,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:53,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:53,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:53,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:53,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:53,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:53,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:53,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:53,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:53,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:53,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:53,806 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:54,274 INFO L244 Elim1Store]: Index analysis took 431 ms [2021-01-06 21:37:57,858 WARN L197 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:37:57,860 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:37:57,861 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:37:57,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:57,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:57,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:57,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:57,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:57,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:57,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:57,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:57,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:57,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:57,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:37:57,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:37:57,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:37:57,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:37:57,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:37:57,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:37:57,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:37:57,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:37:57,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:37:57,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:37:57,928 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-06 21:37:58,445 INFO L244 Elim1Store]: Index analysis took 480 ms [2021-01-06 21:38:03,016 WARN L197 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 481 DAG size of output: 345 [2021-01-06 21:38:03,018 INFO L348 Elim1Store]: treesize reduction 1305, result has 37.5 percent of original size [2021-01-06 21:38:03,019 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 30 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 840 [2021-01-06 21:38:03,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 21:38:03,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:03,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:03,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:03,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:03,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:03,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:03,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:03,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:03,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:03,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:03,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 21:38:03,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:03,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:03,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:03,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:03,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:03,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:03,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:03,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:03,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:03,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:03,091 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-06 21:38:03,512 INFO L244 Elim1Store]: Index analysis took 383 ms [2021-01-06 21:38:07,099 WARN L197 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:38:07,100 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:38:07,101 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:38:07,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:07,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:07,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:07,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:07,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:07,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:07,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:07,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:07,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:07,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:07,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:07,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:07,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:07,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:07,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:07,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:07,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:07,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:07,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:07,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:07,165 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-06 21:38:07,611 INFO L244 Elim1Store]: Index analysis took 407 ms [2021-01-06 21:38:11,132 WARN L197 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2021-01-06 21:38:11,133 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2021-01-06 21:38:11,134 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 30 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 94 treesize of output 707 [2021-01-06 21:38:11,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:11,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:11,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:11,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:11,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:11,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:11,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:11,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:11,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:11,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:11,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 21:38:11,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-06 21:38:11,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 21:38:11,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 21:38:11,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 21:38:11,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 21:38:11,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 21:38:11,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 21:38:11,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 21:38:11,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 21:38:11,188 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-06 21:38:11,593 INFO L244 Elim1Store]: Index analysis took 369 ms