/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-dcfa08f [2020-12-23 11:41:42,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 11:41:42,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 11:41:42,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 11:41:42,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 11:41:42,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 11:41:42,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 11:41:42,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 11:41:42,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 11:41:42,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 11:41:42,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 11:41:42,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 11:41:42,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 11:41:42,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 11:41:42,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 11:41:42,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 11:41:42,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 11:41:42,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 11:41:42,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 11:41:42,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 11:41:42,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 11:41:42,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 11:41:42,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 11:41:42,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 11:41:42,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 11:41:42,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 11:41:42,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 11:41:42,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 11:41:42,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 11:41:42,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 11:41:42,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 11:41:42,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 11:41:42,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 11:41:42,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 11:41:42,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 11:41:42,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 11:41:42,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 11:41:42,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 11:41:42,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 11:41:42,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 11:41:42,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 11:41:42,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 11:41:42,759 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 11:41:42,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 11:41:42,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 11:41:42,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 11:41:42,762 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 11:41:42,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 11:41:42,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 11:41:42,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 11:41:42,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 11:41:42,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 11:41:42,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 11:41:42,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 11:41:42,764 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 11:41:42,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 11:41:42,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 11:41:42,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 11:41:42,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 11:41:42,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:41:42,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 11:41:42,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 11:41:42,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 11:41:42,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 11:41:42,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 11:41:42,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 11:41:42,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 11:41:42,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 11:41:43,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 11:41:43,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 11:41:43,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 11:41:43,320 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 11:41:43,321 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 11:41:43,322 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 [2020-12-23 11:41:43,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb85c4144/f0758fbfd44446eeb47b11f9d0e89901/FLAG89e663209 [2020-12-23 11:41:44,251 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 11:41:44,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2020-12-23 11:41:44,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb85c4144/f0758fbfd44446eeb47b11f9d0e89901/FLAG89e663209 [2020-12-23 11:41:44,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cb85c4144/f0758fbfd44446eeb47b11f9d0e89901 [2020-12-23 11:41:44,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 11:41:44,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 11:41:44,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 11:41:44,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 11:41:44,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 11:41:44,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:41:44" (1/1) ... [2020-12-23 11:41:44,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff2a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:44, skipping insertion in model container [2020-12-23 11:41:44,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:41:44" (1/1) ... [2020-12-23 11:41:44,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 11:41:44,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 11:41:45,255 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]]] [2020-12-23 11:41:45,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:41:45,392 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 11:41:45,436 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]]]]]]] [2020-12-23 11:41:45,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 11:41:45,746 INFO L208 MainTranslator]: Completed translation [2020-12-23 11:41:45,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45 WrapperNode [2020-12-23 11:41:45,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 11:41:45,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 11:41:45,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 11:41:45,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 11:41:45,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:45,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 11:41:46,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 11:41:46,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 11:41:46,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 11:41:46,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... [2020-12-23 11:41:46,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 11:41:46,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 11:41:46,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 11:41:46,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 11:41:46,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 11:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 11:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 11:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 11:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 11:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 11:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 11:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 11:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 11:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 11:41:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 11:41:46,695 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:46,698 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:46,738 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:46,739 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:46,761 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:46,763 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 11:41:52,603 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; [2020-12-23 11:41:52,604 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-10: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,604 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; [2020-12-23 11:41:52,604 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; [2020-12-23 11:41:52,605 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; [2020-12-23 11:41:52,605 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-12: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,605 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; [2020-12-23 11:41:52,605 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; [2020-12-23 11:41:52,606 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; [2020-12-23 11:41:52,606 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; [2020-12-23 11:41:52,606 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; [2020-12-23 11:41:52,606 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; [2020-12-23 11:41:52,607 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; [2020-12-23 11:41:52,607 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-38: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,607 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; [2020-12-23 11:41:52,607 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; [2020-12-23 11:41:52,607 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; [2020-12-23 11:41:52,608 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-40: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,608 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; [2020-12-23 11:41:52,608 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-66: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,608 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; [2020-12-23 11:41:52,609 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; [2020-12-23 11:41:52,609 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-44: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,609 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-44: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,609 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; [2020-12-23 11:41:52,609 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L798-68: assume !(0 != ~__CS_ret~0 % 256); [2020-12-23 11:41:52,610 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-46: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,610 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-46: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,610 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-48: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,610 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-48: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,610 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; [2020-12-23 11:41:52,611 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-50: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,611 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-50: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,611 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; [2020-12-23 11:41:52,611 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; [2020-12-23 11:41:52,611 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; [2020-12-23 11:41:52,612 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; [2020-12-23 11:41:52,612 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; [2020-12-23 11:41:52,612 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; [2020-12-23 11:41:52,612 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; [2020-12-23 11:41:52,612 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; [2020-12-23 11:41:52,613 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; [2020-12-23 11:41:52,613 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; [2020-12-23 11:41:52,613 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; [2020-12-23 11:41:52,613 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-156: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,613 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-156: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,614 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-158: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,614 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-158: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,614 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-160: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,614 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-160: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,614 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-162: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,615 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-162: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,615 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; [2020-12-23 11:41:52,615 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; [2020-12-23 11:41:52,615 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; [2020-12-23 11:41:52,615 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; [2020-12-23 11:41:52,615 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; [2020-12-23 11:41:52,616 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; [2020-12-23 11:41:52,616 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; [2020-12-23 11:41:52,616 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; [2020-12-23 11:41:52,616 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; [2020-12-23 11:41:52,616 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-268: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-268: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-270: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-270: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-272: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-272: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,617 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-274: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,618 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint L6-274: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,618 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; [2020-12-23 11:41:52,618 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; [2020-12-23 11:41:52,618 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; [2020-12-23 11:41:52,618 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; [2020-12-23 11:41:52,619 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; [2020-12-23 11:41:52,619 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; [2020-12-23 11:41:52,619 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; [2020-12-23 11:41:52,619 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; [2020-12-23 11:41:52,619 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; [2020-12-23 11:41:52,620 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; [2020-12-23 11:41:52,620 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; [2020-12-23 11:41:52,620 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; [2020-12-23 11:41:52,620 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; [2020-12-23 11:41:52,620 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; [2020-12-23 11:41:52,621 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; [2020-12-23 11:41:52,621 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; [2020-12-23 11:41:52,621 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; [2020-12-23 11:41:52,621 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; [2020-12-23 11:41:52,621 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##816: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,622 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##817: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,622 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##826: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,622 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##825: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,622 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##476: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,622 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##475: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,623 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,623 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,623 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##135: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,623 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,623 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume !(0 == assume_abort_if_not_~cond); [2020-12-23 11:41:52,624 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##143: assume 0 == assume_abort_if_not_~cond;assume false; [2020-12-23 11:41:52,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 11:41:52,643 INFO L299 CfgBuilder]: Removed 670 assume(true) statements. [2020-12-23 11:41:52,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:41:52 BoogieIcfgContainer [2020-12-23 11:41:52,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 11:41:52,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 11:41:52,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 11:41:52,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 11:41:52,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:41:44" (1/3) ... [2020-12-23 11:41:52,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec22708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:41:52, skipping insertion in model container [2020-12-23 11:41:52,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:41:45" (2/3) ... [2020-12-23 11:41:52,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec22708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:41:52, skipping insertion in model container [2020-12-23 11:41:52,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:41:52" (3/3) ... [2020-12-23 11:41:52,657 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2020-12-23 11:41:52,665 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 11:41:52,672 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 11:41:52,696 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 11:41:52,736 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 11:41:52,736 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 11:41:52,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 11:41:52,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 11:41:52,737 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 11:41:52,737 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 11:41:52,737 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 11:41:52,738 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 11:41:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states. [2020-12-23 11:41:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 11:41:52,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:52,786 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] [2020-12-23 11:41:52,788 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:52,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1767597317, now seen corresponding path program 1 times [2020-12-23 11:41:52,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:52,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133112669] [2020-12-23 11:41:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:41:53,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133112669] [2020-12-23 11:41:53,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:53,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:53,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119990070] [2020-12-23 11:41:53,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:41:53,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:41:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:53,276 INFO L87 Difference]: Start difference. First operand 763 states. Second operand 3 states. [2020-12-23 11:41:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:53,478 INFO L93 Difference]: Finished difference Result 1528 states and 2370 transitions. [2020-12-23 11:41:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:41:53,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-12-23 11:41:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:53,507 INFO L225 Difference]: With dead ends: 1528 [2020-12-23 11:41:53,507 INFO L226 Difference]: Without dead ends: 763 [2020-12-23 11:41:53,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2020-12-23 11:41:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 760. [2020-12-23 11:41:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2020-12-23 11:41:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 998 transitions. [2020-12-23 11:41:53,649 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 998 transitions. Word has length 32 [2020-12-23 11:41:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:53,650 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 998 transitions. [2020-12-23 11:41:53,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:41:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 998 transitions. [2020-12-23 11:41:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 11:41:53,654 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:53,655 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] [2020-12-23 11:41:53,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 11:41:53,655 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 120502239, now seen corresponding path program 1 times [2020-12-23 11:41:53,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:53,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747184714] [2020-12-23 11:41:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:41:53,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747184714] [2020-12-23 11:41:53,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:53,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:53,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265827632] [2020-12-23 11:41:53,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:41:53,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:41:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:53,840 INFO L87 Difference]: Start difference. First operand 760 states and 998 transitions. Second operand 3 states. [2020-12-23 11:41:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:53,899 INFO L93 Difference]: Finished difference Result 1519 states and 1996 transitions. [2020-12-23 11:41:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:41:53,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-23 11:41:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:53,910 INFO L225 Difference]: With dead ends: 1519 [2020-12-23 11:41:53,912 INFO L226 Difference]: Without dead ends: 762 [2020-12-23 11:41:53,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:41:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2020-12-23 11:41:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 761. [2020-12-23 11:41:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2020-12-23 11:41:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 999 transitions. [2020-12-23 11:41:53,956 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 999 transitions. Word has length 35 [2020-12-23 11:41:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:53,957 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 999 transitions. [2020-12-23 11:41:53,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:41:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 999 transitions. [2020-12-23 11:41:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 11:41:53,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:53,965 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] [2020-12-23 11:41:53,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 11:41:53,966 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1650351007, now seen corresponding path program 1 times [2020-12-23 11:41:53,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:53,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948928487] [2020-12-23 11:41:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:41:54,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948928487] [2020-12-23 11:41:54,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085536939] [2020-12-23 11:41:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:41:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:54,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 11:41:54,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:41:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 11:41:54,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:41:54,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-23 11:41:54,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26321360] [2020-12-23 11:41:54,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:41:54,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:54,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:41:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:41:54,773 INFO L87 Difference]: Start difference. First operand 761 states and 999 transitions. Second operand 5 states. [2020-12-23 11:41:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:54,866 INFO L93 Difference]: Finished difference Result 1522 states and 1999 transitions. [2020-12-23 11:41:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:41:54,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 11:41:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:54,875 INFO L225 Difference]: With dead ends: 1522 [2020-12-23 11:41:54,876 INFO L226 Difference]: Without dead ends: 764 [2020-12-23 11:41:54,878 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 [2020-12-23 11:41:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-12-23 11:41:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 763. [2020-12-23 11:41:54,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2020-12-23 11:41:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1001 transitions. [2020-12-23 11:41:54,909 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1001 transitions. Word has length 37 [2020-12-23 11:41:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:54,910 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1001 transitions. [2020-12-23 11:41:54,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:41:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1001 transitions. [2020-12-23 11:41:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 11:41:54,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:54,918 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] [2020-12-23 11:41:55,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 11:41:55,132 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1661696099, now seen corresponding path program 2 times [2020-12-23 11:41:55,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:55,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253781350] [2020-12-23 11:41:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 11:41:55,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253781350] [2020-12-23 11:41:55,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393144719] [2020-12-23 11:41:55,316 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 [2020-12-23 11:41:55,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 11:41:55,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 11:41:55,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 11:41:55,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:41:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 11:41:56,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 11:41:56,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-12-23 11:41:56,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56677724] [2020-12-23 11:41:56,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:41:56,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:41:56,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:41:56,119 INFO L87 Difference]: Start difference. First operand 763 states and 1001 transitions. Second operand 5 states. [2020-12-23 11:41:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:57,461 INFO L93 Difference]: Finished difference Result 1425 states and 1872 transitions. [2020-12-23 11:41:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:41:57,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-23 11:41:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:57,470 INFO L225 Difference]: With dead ends: 1425 [2020-12-23 11:41:57,471 INFO L226 Difference]: Without dead ends: 1346 [2020-12-23 11:41:57,472 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 [2020-12-23 11:41:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-12-23 11:41:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1335. [2020-12-23 11:41:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2020-12-23 11:41:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1738 transitions. [2020-12-23 11:41:57,539 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1738 transitions. Word has length 39 [2020-12-23 11:41:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:57,540 INFO L481 AbstractCegarLoop]: Abstraction has 1335 states and 1738 transitions. [2020-12-23 11:41:57,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:41:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1738 transitions. [2020-12-23 11:41:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 11:41:57,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:57,546 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] [2020-12-23 11:41:57,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:41:57,763 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash -521614835, now seen corresponding path program 1 times [2020-12-23 11:41:57,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:57,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674285389] [2020-12-23 11:41:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 11:41:57,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674285389] [2020-12-23 11:41:57,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398666618] [2020-12-23 11:41:57,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:41:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:58,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 11:41:58,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:41:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 11:41:58,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 11:41:58,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-12-23 11:41:58,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412812562] [2020-12-23 11:41:58,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:41:58,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:58,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:41:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:41:58,559 INFO L87 Difference]: Start difference. First operand 1335 states and 1738 transitions. Second operand 7 states. [2020-12-23 11:41:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:41:58,890 INFO L93 Difference]: Finished difference Result 2678 states and 3488 transitions. [2020-12-23 11:41:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 11:41:58,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2020-12-23 11:41:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:41:58,899 INFO L225 Difference]: With dead ends: 2678 [2020-12-23 11:41:58,900 INFO L226 Difference]: Without dead ends: 1346 [2020-12-23 11:41:58,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:41:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-12-23 11:41:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2020-12-23 11:41:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-12-23 11:41:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1750 transitions. [2020-12-23 11:41:58,938 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1750 transitions. Word has length 81 [2020-12-23 11:41:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:41:58,939 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1750 transitions. [2020-12-23 11:41:58,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:41:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1750 transitions. [2020-12-23 11:41:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:41:58,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:41:58,943 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] [2020-12-23 11:41:59,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:41:59,168 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:41:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:41:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -303981155, now seen corresponding path program 2 times [2020-12-23 11:41:59,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:41:59,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513790076] [2020-12-23 11:41:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:41:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:41:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:41:59,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513790076] [2020-12-23 11:41:59,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:41:59,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:41:59,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888475234] [2020-12-23 11:41:59,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:41:59,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:41:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:41:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:41:59,514 INFO L87 Difference]: Start difference. First operand 1346 states and 1750 transitions. Second operand 4 states. [2020-12-23 11:42:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:01,898 INFO L93 Difference]: Finished difference Result 2445 states and 3161 transitions. [2020-12-23 11:42:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:42:01,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 11:42:01,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:01,912 INFO L225 Difference]: With dead ends: 2445 [2020-12-23 11:42:01,913 INFO L226 Difference]: Without dead ends: 2111 [2020-12-23 11:42:01,915 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 [2020-12-23 11:42:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-12-23 11:42:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1947. [2020-12-23 11:42:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2020-12-23 11:42:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2547 transitions. [2020-12-23 11:42:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2547 transitions. Word has length 92 [2020-12-23 11:42:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:01,979 INFO L481 AbstractCegarLoop]: Abstraction has 1947 states and 2547 transitions. [2020-12-23 11:42:01,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:42:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2547 transitions. [2020-12-23 11:42:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:42:01,983 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:01,983 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] [2020-12-23 11:42:01,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 11:42:01,984 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1784930909, now seen corresponding path program 1 times [2020-12-23 11:42:01,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:01,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25598316] [2020-12-23 11:42:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:05,504 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2020-12-23 11:42:05,724 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-12-23 11:42:06,037 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-12-23 11:42:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:42:06,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25598316] [2020-12-23 11:42:06,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:06,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:42:06,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882014601] [2020-12-23 11:42:06,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:42:06,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:42:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:42:06,187 INFO L87 Difference]: Start difference. First operand 1947 states and 2547 transitions. Second operand 6 states. [2020-12-23 11:42:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:11,397 INFO L93 Difference]: Finished difference Result 2692 states and 3506 transitions. [2020-12-23 11:42:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:42:11,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-12-23 11:42:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:11,410 INFO L225 Difference]: With dead ends: 2692 [2020-12-23 11:42:11,410 INFO L226 Difference]: Without dead ends: 2500 [2020-12-23 11:42:11,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:42:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2020-12-23 11:42:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2474. [2020-12-23 11:42:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-12-23 11:42:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3225 transitions. [2020-12-23 11:42:11,493 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3225 transitions. Word has length 92 [2020-12-23 11:42:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:11,494 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 3225 transitions. [2020-12-23 11:42:11,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:42:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3225 transitions. [2020-12-23 11:42:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:42:11,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:11,504 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] [2020-12-23 11:42:11,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 11:42:11,504 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 201854813, now seen corresponding path program 1 times [2020-12-23 11:42:11,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:11,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538765887] [2020-12-23 11:42:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:42:11,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538765887] [2020-12-23 11:42:11,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:11,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:42:11,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574367726] [2020-12-23 11:42:11,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:42:11,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:42:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:42:11,736 INFO L87 Difference]: Start difference. First operand 2474 states and 3225 transitions. Second operand 4 states. [2020-12-23 11:42:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:14,103 INFO L93 Difference]: Finished difference Result 3249 states and 4198 transitions. [2020-12-23 11:42:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:42:14,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 11:42:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:14,118 INFO L225 Difference]: With dead ends: 3249 [2020-12-23 11:42:14,119 INFO L226 Difference]: Without dead ends: 2121 [2020-12-23 11:42:14,122 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 [2020-12-23 11:42:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2020-12-23 11:42:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1951. [2020-12-23 11:42:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2020-12-23 11:42:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2541 transitions. [2020-12-23 11:42:14,193 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2541 transitions. Word has length 92 [2020-12-23 11:42:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:14,194 INFO L481 AbstractCegarLoop]: Abstraction has 1951 states and 2541 transitions. [2020-12-23 11:42:14,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:42:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2541 transitions. [2020-12-23 11:42:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:42:14,198 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:14,198 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] [2020-12-23 11:42:14,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 11:42:14,199 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1775712547, now seen corresponding path program 1 times [2020-12-23 11:42:14,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:14,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568201815] [2020-12-23 11:42:14,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:17,832 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2020-12-23 11:42:18,303 WARN L197 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2020-12-23 11:42:18,891 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-12-23 11:42:19,178 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2020-12-23 11:42:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:42:19,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568201815] [2020-12-23 11:42:19,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:19,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:42:19,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567650409] [2020-12-23 11:42:19,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:42:19,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:42:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:42:19,279 INFO L87 Difference]: Start difference. First operand 1951 states and 2541 transitions. Second operand 6 states. [2020-12-23 11:42:19,467 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-12-23 11:42:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:24,262 INFO L93 Difference]: Finished difference Result 2249 states and 2907 transitions. [2020-12-23 11:42:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:42:24,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-12-23 11:42:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:24,298 INFO L225 Difference]: With dead ends: 2249 [2020-12-23 11:42:24,299 INFO L226 Difference]: Without dead ends: 1811 [2020-12-23 11:42:24,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 12 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-23 11:42:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2020-12-23 11:42:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1787. [2020-12-23 11:42:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2020-12-23 11:42:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2314 transitions. [2020-12-23 11:42:24,372 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2314 transitions. Word has length 92 [2020-12-23 11:42:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:24,372 INFO L481 AbstractCegarLoop]: Abstraction has 1787 states and 2314 transitions. [2020-12-23 11:42:24,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:42:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2314 transitions. [2020-12-23 11:42:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:42:24,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:24,376 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] [2020-12-23 11:42:24,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 11:42:24,377 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1342921059, now seen corresponding path program 1 times [2020-12-23 11:42:24,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:24,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065041686] [2020-12-23 11:42:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:42:24,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065041686] [2020-12-23 11:42:24,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:24,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:24,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807962185] [2020-12-23 11:42:24,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:42:24,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:42:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:42:24,590 INFO L87 Difference]: Start difference. First operand 1787 states and 2314 transitions. Second operand 4 states. [2020-12-23 11:42:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:24,849 INFO L93 Difference]: Finished difference Result 2301 states and 2941 transitions. [2020-12-23 11:42:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:42:24,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 11:42:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:24,863 INFO L225 Difference]: With dead ends: 2301 [2020-12-23 11:42:24,863 INFO L226 Difference]: Without dead ends: 1790 [2020-12-23 11:42:24,865 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 [2020-12-23 11:42:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-12-23 11:42:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1585. [2020-12-23 11:42:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-12-23 11:42:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2052 transitions. [2020-12-23 11:42:24,919 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2052 transitions. Word has length 92 [2020-12-23 11:42:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:24,919 INFO L481 AbstractCegarLoop]: Abstraction has 1585 states and 2052 transitions. [2020-12-23 11:42:24,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:42:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2052 transitions. [2020-12-23 11:42:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 11:42:24,921 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:24,922 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] [2020-12-23 11:42:24,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 11:42:24,922 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 410880155, now seen corresponding path program 1 times [2020-12-23 11:42:24,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:24,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963136498] [2020-12-23 11:42:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:42:25,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963136498] [2020-12-23 11:42:25,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:25,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940036987] [2020-12-23 11:42:25,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:42:25,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:42:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:42:25,070 INFO L87 Difference]: Start difference. First operand 1585 states and 2052 transitions. Second operand 4 states. [2020-12-23 11:42:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:25,359 INFO L93 Difference]: Finished difference Result 2092 states and 2671 transitions. [2020-12-23 11:42:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 11:42:25,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 11:42:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:25,370 INFO L225 Difference]: With dead ends: 2092 [2020-12-23 11:42:25,371 INFO L226 Difference]: Without dead ends: 1580 [2020-12-23 11:42:25,372 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 [2020-12-23 11:42:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2020-12-23 11:42:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1375. [2020-12-23 11:42:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2020-12-23 11:42:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1781 transitions. [2020-12-23 11:42:25,423 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1781 transitions. Word has length 92 [2020-12-23 11:42:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:25,423 INFO L481 AbstractCegarLoop]: Abstraction has 1375 states and 1781 transitions. [2020-12-23 11:42:25,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:42:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1781 transitions. [2020-12-23 11:42:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:42:25,429 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:25,430 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] [2020-12-23 11:42:25,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 11:42:25,430 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1417338593, now seen corresponding path program 1 times [2020-12-23 11:42:25,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:25,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067616669] [2020-12-23 11:42:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:25,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067616669] [2020-12-23 11:42:25,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:25,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:42:25,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449474719] [2020-12-23 11:42:25,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:42:25,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:42:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:42:25,631 INFO L87 Difference]: Start difference. First operand 1375 states and 1781 transitions. Second operand 3 states. [2020-12-23 11:42:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:26,059 INFO L93 Difference]: Finished difference Result 2414 states and 3130 transitions. [2020-12-23 11:42:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:42:26,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2020-12-23 11:42:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:26,066 INFO L225 Difference]: With dead ends: 2414 [2020-12-23 11:42:26,066 INFO L226 Difference]: Without dead ends: 1111 [2020-12-23 11:42:26,068 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 [2020-12-23 11:42:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2020-12-23 11:42:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2020-12-23 11:42:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2020-12-23 11:42:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1432 transitions. [2020-12-23 11:42:26,099 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1432 transitions. Word has length 120 [2020-12-23 11:42:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:26,099 INFO L481 AbstractCegarLoop]: Abstraction has 1111 states and 1432 transitions. [2020-12-23 11:42:26,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:42:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1432 transitions. [2020-12-23 11:42:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:42:26,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:26,102 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] [2020-12-23 11:42:26,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 11:42:26,102 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1851067679, now seen corresponding path program 1 times [2020-12-23 11:42:26,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:26,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268321260] [2020-12-23 11:42:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:26,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268321260] [2020-12-23 11:42:26,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:26,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:26,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853976285] [2020-12-23 11:42:26,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:42:26,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:42:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:42:26,290 INFO L87 Difference]: Start difference. First operand 1111 states and 1432 transitions. Second operand 4 states. [2020-12-23 11:42:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:27,224 INFO L93 Difference]: Finished difference Result 2778 states and 3582 transitions. [2020-12-23 11:42:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:42:27,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 11:42:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:27,233 INFO L225 Difference]: With dead ends: 2778 [2020-12-23 11:42:27,234 INFO L226 Difference]: Without dead ends: 1739 [2020-12-23 11:42:27,236 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 [2020-12-23 11:42:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2020-12-23 11:42:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1483. [2020-12-23 11:42:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-12-23 11:42:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1911 transitions. [2020-12-23 11:42:27,283 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1911 transitions. Word has length 120 [2020-12-23 11:42:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:27,284 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1911 transitions. [2020-12-23 11:42:27,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:42:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1911 transitions. [2020-12-23 11:42:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:42:27,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:27,288 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] [2020-12-23 11:42:27,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 11:42:27,288 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1835548961, now seen corresponding path program 1 times [2020-12-23 11:42:27,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:27,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345995523] [2020-12-23 11:42:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:29,104 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-12-23 11:42:29,341 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-12-23 11:42:29,635 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-12-23 11:42:29,923 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2020-12-23 11:42:30,123 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-12-23 11:42:30,362 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2020-12-23 11:42:30,609 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-12-23 11:42:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:30,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345995523] [2020-12-23 11:42:30,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:30,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 11:42:30,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497950589] [2020-12-23 11:42:30,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 11:42:30,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 11:42:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-12-23 11:42:30,998 INFO L87 Difference]: Start difference. First operand 1483 states and 1911 transitions. Second operand 12 states. [2020-12-23 11:42:31,323 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-12-23 11:42:34,008 WARN L197 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-12-23 11:42:34,828 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2020-12-23 11:42:35,281 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2020-12-23 11:42:35,726 WARN L197 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2020-12-23 11:42:36,406 WARN L197 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2020-12-23 11:42:36,716 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-23 11:42:37,090 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-12-23 11:42:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:44,626 INFO L93 Difference]: Finished difference Result 2908 states and 3756 transitions. [2020-12-23 11:42:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 11:42:44,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2020-12-23 11:42:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:44,639 INFO L225 Difference]: With dead ends: 2908 [2020-12-23 11:42:44,639 INFO L226 Difference]: Without dead ends: 2355 [2020-12-23 11:42:44,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-12-23 11:42:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2020-12-23 11:42:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1495. [2020-12-23 11:42:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-12-23 11:42:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1926 transitions. [2020-12-23 11:42:44,693 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1926 transitions. Word has length 120 [2020-12-23 11:42:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:44,693 INFO L481 AbstractCegarLoop]: Abstraction has 1495 states and 1926 transitions. [2020-12-23 11:42:44,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 11:42:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1926 transitions. [2020-12-23 11:42:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 11:42:44,696 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:44,697 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] [2020-12-23 11:42:44,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 11:42:44,697 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash -921078305, now seen corresponding path program 1 times [2020-12-23 11:42:44,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:44,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272457764] [2020-12-23 11:42:44,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:45,698 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-12-23 11:42:45,923 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-12-23 11:42:46,304 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-12-23 11:42:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:46,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272457764] [2020-12-23 11:42:46,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:46,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:42:46,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615326205] [2020-12-23 11:42:46,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:42:46,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:42:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:42:46,565 INFO L87 Difference]: Start difference. First operand 1495 states and 1926 transitions. Second operand 10 states. [2020-12-23 11:42:48,872 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2020-12-23 11:42:49,121 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-12-23 11:42:49,474 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-12-23 11:42:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:52,980 INFO L93 Difference]: Finished difference Result 2826 states and 3644 transitions. [2020-12-23 11:42:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 11:42:52,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2020-12-23 11:42:52,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:52,991 INFO L225 Difference]: With dead ends: 2826 [2020-12-23 11:42:52,992 INFO L226 Difference]: Without dead ends: 2273 [2020-12-23 11:42:52,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-12-23 11:42:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2020-12-23 11:42:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1483. [2020-12-23 11:42:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2020-12-23 11:42:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1910 transitions. [2020-12-23 11:42:53,054 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1910 transitions. Word has length 120 [2020-12-23 11:42:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:53,054 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1910 transitions. [2020-12-23 11:42:53,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:42:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1910 transitions. [2020-12-23 11:42:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 11:42:53,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:53,061 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] [2020-12-23 11:42:53,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 11:42:53,061 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1071723917, now seen corresponding path program 1 times [2020-12-23 11:42:53,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:53,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208102045] [2020-12-23 11:42:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:53,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208102045] [2020-12-23 11:42:53,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:53,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 11:42:53,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246897185] [2020-12-23 11:42:53,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 11:42:53,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 11:42:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:42:53,246 INFO L87 Difference]: Start difference. First operand 1483 states and 1910 transitions. Second operand 3 states. [2020-12-23 11:42:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:53,378 INFO L93 Difference]: Finished difference Result 2522 states and 3265 transitions. [2020-12-23 11:42:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 11:42:53,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2020-12-23 11:42:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:53,385 INFO L225 Difference]: With dead ends: 2522 [2020-12-23 11:42:53,385 INFO L226 Difference]: Without dead ends: 1494 [2020-12-23 11:42:53,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 11:42:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-12-23 11:42:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2020-12-23 11:42:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2020-12-23 11:42:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1921 transitions. [2020-12-23 11:42:53,439 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1921 transitions. Word has length 123 [2020-12-23 11:42:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:53,440 INFO L481 AbstractCegarLoop]: Abstraction has 1494 states and 1921 transitions. [2020-12-23 11:42:53,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 11:42:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1921 transitions. [2020-12-23 11:42:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 11:42:53,443 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:53,443 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] [2020-12-23 11:42:53,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 11:42:53,444 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:53,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1319870411, now seen corresponding path program 1 times [2020-12-23 11:42:53,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:53,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980289377] [2020-12-23 11:42:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:42:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:42:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:42:56,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980289377] [2020-12-23 11:42:56,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:42:56,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:42:56,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552530346] [2020-12-23 11:42:56,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 11:42:56,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:42:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 11:42:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 11:42:56,178 INFO L87 Difference]: Start difference. First operand 1494 states and 1921 transitions. Second operand 5 states. [2020-12-23 11:42:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:42:59,053 INFO L93 Difference]: Finished difference Result 3712 states and 4750 transitions. [2020-12-23 11:42:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:42:59,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2020-12-23 11:42:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:42:59,065 INFO L225 Difference]: With dead ends: 3712 [2020-12-23 11:42:59,065 INFO L226 Difference]: Without dead ends: 2181 [2020-12-23 11:42:59,068 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 [2020-12-23 11:42:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2020-12-23 11:42:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1722. [2020-12-23 11:42:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-12-23 11:42:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2119 transitions. [2020-12-23 11:42:59,136 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2119 transitions. Word has length 123 [2020-12-23 11:42:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:42:59,137 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 2119 transitions. [2020-12-23 11:42:59,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 11:42:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2119 transitions. [2020-12-23 11:42:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 11:42:59,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:42:59,140 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] [2020-12-23 11:42:59,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 11:42:59,141 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:42:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:42:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 571351879, now seen corresponding path program 1 times [2020-12-23 11:42:59,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:42:59,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013497785] [2020-12-23 11:42:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:43:03,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013497785] [2020-12-23 11:43:03,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:03,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 11:43:03,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530755235] [2020-12-23 11:43:03,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 11:43:03,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 11:43:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-23 11:43:03,289 INFO L87 Difference]: Start difference. First operand 1722 states and 2119 transitions. Second operand 10 states. [2020-12-23 11:43:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:17,155 INFO L93 Difference]: Finished difference Result 2812 states and 3432 transitions. [2020-12-23 11:43:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 11:43:17,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-12-23 11:43:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:17,164 INFO L225 Difference]: With dead ends: 2812 [2020-12-23 11:43:17,164 INFO L226 Difference]: Without dead ends: 2144 [2020-12-23 11:43:17,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-12-23 11:43:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2020-12-23 11:43:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1948. [2020-12-23 11:43:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2020-12-23 11:43:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2389 transitions. [2020-12-23 11:43:17,260 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2389 transitions. Word has length 123 [2020-12-23 11:43:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:17,260 INFO L481 AbstractCegarLoop]: Abstraction has 1948 states and 2389 transitions. [2020-12-23 11:43:17,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 11:43:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2389 transitions. [2020-12-23 11:43:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 11:43:17,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:17,265 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] [2020-12-23 11:43:17,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 11:43:17,265 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1950644145, now seen corresponding path program 1 times [2020-12-23 11:43:17,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:17,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150865493] [2020-12-23 11:43:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:43:18,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150865493] [2020-12-23 11:43:18,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:18,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 11:43:18,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747590517] [2020-12-23 11:43:18,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 11:43:18,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 11:43:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 11:43:18,244 INFO L87 Difference]: Start difference. First operand 1948 states and 2389 transitions. Second operand 7 states. [2020-12-23 11:43:20,789 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2020-12-23 11:43:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:22,372 INFO L93 Difference]: Finished difference Result 3111 states and 3770 transitions. [2020-12-23 11:43:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 11:43:22,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2020-12-23 11:43:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:22,380 INFO L225 Difference]: With dead ends: 3111 [2020-12-23 11:43:22,380 INFO L226 Difference]: Without dead ends: 2786 [2020-12-23 11:43:22,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 11:43:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2020-12-23 11:43:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1969. [2020-12-23 11:43:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2020-12-23 11:43:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2431 transitions. [2020-12-23 11:43:22,459 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2431 transitions. Word has length 135 [2020-12-23 11:43:22,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:22,460 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 2431 transitions. [2020-12-23 11:43:22,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 11:43:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2431 transitions. [2020-12-23 11:43:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 11:43:22,464 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:22,464 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] [2020-12-23 11:43:22,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 11:43:22,465 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash 490381273, now seen corresponding path program 1 times [2020-12-23 11:43:22,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:22,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744789575] [2020-12-23 11:43:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:28,075 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 11:43:28,388 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-12-23 11:43:28,537 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-12-23 11:43:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:43:29,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744789575] [2020-12-23 11:43:29,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:29,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 11:43:29,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74195585] [2020-12-23 11:43:29,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 11:43:29,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:29,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 11:43:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-23 11:43:29,125 INFO L87 Difference]: Start difference. First operand 1969 states and 2431 transitions. Second operand 14 states. [2020-12-23 11:43:31,498 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-12-23 11:43:31,768 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-12-23 11:43:31,924 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-23 11:43:32,234 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-12-23 11:43:34,649 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-12-23 11:43:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:35,876 INFO L93 Difference]: Finished difference Result 3174 states and 3838 transitions. [2020-12-23 11:43:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 11:43:35,877 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2020-12-23 11:43:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:35,884 INFO L225 Difference]: With dead ends: 3174 [2020-12-23 11:43:35,885 INFO L226 Difference]: Without dead ends: 2800 [2020-12-23 11:43:35,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2020-12-23 11:43:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2020-12-23 11:43:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 1895. [2020-12-23 11:43:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2020-12-23 11:43:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2345 transitions. [2020-12-23 11:43:35,971 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2345 transitions. Word has length 136 [2020-12-23 11:43:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:35,971 INFO L481 AbstractCegarLoop]: Abstraction has 1895 states and 2345 transitions. [2020-12-23 11:43:35,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 11:43:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2345 transitions. [2020-12-23 11:43:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 11:43:35,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:35,976 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] [2020-12-23 11:43:35,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 11:43:35,976 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1262141787, now seen corresponding path program 1 times [2020-12-23 11:43:35,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:35,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762955921] [2020-12-23 11:43:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:38,776 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2020-12-23 11:43:39,067 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2020-12-23 11:43:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:43:39,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762955921] [2020-12-23 11:43:39,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:39,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 11:43:39,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063617791] [2020-12-23 11:43:39,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 11:43:39,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 11:43:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 11:43:39,422 INFO L87 Difference]: Start difference. First operand 1895 states and 2345 transitions. Second operand 11 states. [2020-12-23 11:43:41,684 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-12-23 11:43:41,994 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-12-23 11:43:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:44,459 INFO L93 Difference]: Finished difference Result 2511 states and 3066 transitions. [2020-12-23 11:43:44,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 11:43:44,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2020-12-23 11:43:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:44,465 INFO L225 Difference]: With dead ends: 2511 [2020-12-23 11:43:44,466 INFO L226 Difference]: Without dead ends: 2349 [2020-12-23 11:43:44,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-12-23 11:43:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2020-12-23 11:43:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1893. [2020-12-23 11:43:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2020-12-23 11:43:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2340 transitions. [2020-12-23 11:43:44,559 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2340 transitions. Word has length 136 [2020-12-23 11:43:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:44,559 INFO L481 AbstractCegarLoop]: Abstraction has 1893 states and 2340 transitions. [2020-12-23 11:43:44,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 11:43:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2340 transitions. [2020-12-23 11:43:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 11:43:44,565 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:44,566 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] [2020-12-23 11:43:44,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 11:43:44,566 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash -398202993, now seen corresponding path program 1 times [2020-12-23 11:43:44,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:44,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159104762] [2020-12-23 11:43:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:43:45,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159104762] [2020-12-23 11:43:45,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:45,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:43:45,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375301606] [2020-12-23 11:43:45,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:43:45,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:43:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:43:45,550 INFO L87 Difference]: Start difference. First operand 1893 states and 2340 transitions. Second operand 6 states. [2020-12-23 11:43:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:48,728 INFO L93 Difference]: Finished difference Result 2239 states and 2738 transitions. [2020-12-23 11:43:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 11:43:48,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2020-12-23 11:43:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:48,733 INFO L225 Difference]: With dead ends: 2239 [2020-12-23 11:43:48,734 INFO L226 Difference]: Without dead ends: 1930 [2020-12-23 11:43:48,735 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 [2020-12-23 11:43:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-12-23 11:43:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1752. [2020-12-23 11:43:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-12-23 11:43:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2161 transitions. [2020-12-23 11:43:48,812 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2161 transitions. Word has length 144 [2020-12-23 11:43:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:48,813 INFO L481 AbstractCegarLoop]: Abstraction has 1752 states and 2161 transitions. [2020-12-23 11:43:48,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:43:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2161 transitions. [2020-12-23 11:43:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 11:43:48,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:48,817 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] [2020-12-23 11:43:48,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 11:43:48,817 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1021803665, now seen corresponding path program 1 times [2020-12-23 11:43:48,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:48,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763634256] [2020-12-23 11:43:48,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:43:50,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763634256] [2020-12-23 11:43:50,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:50,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 11:43:50,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410178628] [2020-12-23 11:43:50,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 11:43:50,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 11:43:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 11:43:50,707 INFO L87 Difference]: Start difference. First operand 1752 states and 2161 transitions. Second operand 6 states. [2020-12-23 11:43:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:53,791 INFO L93 Difference]: Finished difference Result 3628 states and 4457 transitions. [2020-12-23 11:43:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 11:43:53,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2020-12-23 11:43:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:53,796 INFO L225 Difference]: With dead ends: 3628 [2020-12-23 11:43:53,796 INFO L226 Difference]: Without dead ends: 2054 [2020-12-23 11:43:53,798 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 [2020-12-23 11:43:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2020-12-23 11:43:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1869. [2020-12-23 11:43:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2020-12-23 11:43:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2283 transitions. [2020-12-23 11:43:53,882 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2283 transitions. Word has length 144 [2020-12-23 11:43:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:53,883 INFO L481 AbstractCegarLoop]: Abstraction has 1869 states and 2283 transitions. [2020-12-23 11:43:53,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 11:43:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2283 transitions. [2020-12-23 11:43:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 11:43:53,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:53,886 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] [2020-12-23 11:43:53,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 11:43:53,887 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:53,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2087716967, now seen corresponding path program 1 times [2020-12-23 11:43:53,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:53,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114151247] [2020-12-23 11:43:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:43:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:43:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-12-23 11:43:56,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114151247] [2020-12-23 11:43:56,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 11:43:56,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 11:43:56,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582778723] [2020-12-23 11:43:56,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 11:43:56,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 11:43:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 11:43:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 11:43:56,262 INFO L87 Difference]: Start difference. First operand 1869 states and 2283 transitions. Second operand 4 states. [2020-12-23 11:43:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 11:43:58,645 INFO L93 Difference]: Finished difference Result 3689 states and 4488 transitions. [2020-12-23 11:43:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 11:43:58,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 11:43:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 11:43:58,652 INFO L225 Difference]: With dead ends: 3689 [2020-12-23 11:43:58,652 INFO L226 Difference]: Without dead ends: 2036 [2020-12-23 11:43:58,654 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 [2020-12-23 11:43:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2020-12-23 11:43:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1992. [2020-12-23 11:43:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2020-12-23 11:43:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2406 transitions. [2020-12-23 11:43:58,749 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2406 transitions. Word has length 145 [2020-12-23 11:43:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 11:43:58,749 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2406 transitions. [2020-12-23 11:43:58,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 11:43:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2406 transitions. [2020-12-23 11:43:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 11:43:58,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 11:43:58,754 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] [2020-12-23 11:43:58,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 11:43:58,754 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 11:43:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 11:43:58,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1182405927, now seen corresponding path program 1 times [2020-12-23 11:43:58,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 11:43:58,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878394776] [2020-12-23 11:43:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 11:44:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:44:09,710 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2020-12-23 11:44:10,315 WARN L197 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 86 [2020-12-23 11:44:10,997 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 99 [2020-12-23 11:44:11,688 WARN L197 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 100 [2020-12-23 11:44:12,487 WARN L197 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 102 [2020-12-23 11:44:13,353 WARN L197 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 104 [2020-12-23 11:44:14,030 WARN L197 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 90 [2020-12-23 11:44:14,733 WARN L197 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 97 [2020-12-23 11:44:15,759 WARN L197 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 111 [2020-12-23 11:44:16,519 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 105 [2020-12-23 11:44:17,419 WARN L197 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 115 [2020-12-23 11:44:18,225 WARN L197 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 108 [2020-12-23 11:44:18,981 WARN L197 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 99 [2020-12-23 11:44:19,883 WARN L197 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 108 [2020-12-23 11:44:20,671 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 106 [2020-12-23 11:44:21,602 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 98 [2020-12-23 11:44:22,720 WARN L197 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 109 [2020-12-23 11:44:23,907 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 180 DAG size of output: 115 [2020-12-23 11:44:24,991 WARN L197 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2020-12-23 11:44:25,817 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 87 [2020-12-23 11:44:26,546 WARN L197 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2020-12-23 11:44:27,102 WARN L197 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-12-23 11:44:27,506 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-12-23 11:44:27,906 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-12-23 11:44:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-12-23 11:44:28,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878394776] [2020-12-23 11:44:28,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863590454] [2020-12-23 11:44:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 11:44:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 11:44:51,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 89 conjunts are in the unsatisfiable core [2020-12-23 11:44:51,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 11:44:53,312 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 226 DAG size of output: 76 [2020-12-23 11:44:53,314 INFO L348 Elim1Store]: treesize reduction 1179, result has 10.6 percent of original size [2020-12-23 11:44:53,315 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 [2020-12-23 11:44:53,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:44:53,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:44:53,353 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 11:44:53,355 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 11:44:53,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:44:53,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 11:44:53,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:44:53,405 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 11:44:54,308 WARN L197 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 118 [2020-12-23 11:44:54,310 INFO L625 ElimStorePlain]: treesize reduction 582, result has 27.1 percent of original size [2020-12-23 11:44:54,326 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,333 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,340 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,345 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 16 disjuncts [2020-12-23 11:44:54,355 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. [2020-12-23 11:44:54,355 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:168, output treesize:216 [2020-12-23 11:44:54,367 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,372 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,376 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,380 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 16 disjuncts [2020-12-23 11:44:54,786 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-23 11:44:54,834 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,840 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,844 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 6 disjuncts [2020-12-23 11:44:54,850 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 14 disjuncts [2020-12-23 11:44:54,860 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 26 disjuncts [2020-12-23 11:44:55,507 INFO L244 Elim1Store]: Index analysis took 501 ms [2020-12-23 11:45:00,828 WARN L197 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2020-12-23 11:45:00,829 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2020-12-23 11:45:00,830 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 [2020-12-23 11:45:00,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:00,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:00,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:00,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:00,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:00,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:00,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:00,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:00,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:00,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:00,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:00,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:00,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:00,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:00,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:00,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:00,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:00,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:00,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:00,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:00,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 11:45:01,429 INFO L244 Elim1Store]: Index analysis took 484 ms [2020-12-23 11:45:06,769 WARN L197 SmtUtils]: Spent 5.28 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2020-12-23 11:45:06,770 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2020-12-23 11:45:06,771 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 [2020-12-23 11:45:06,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:06,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:06,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:06,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:06,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:06,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:06,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:06,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:06,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:06,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:06,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:06,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:06,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:06,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:06,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:06,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:06,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:06,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:06,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:06,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:06,868 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 11:45:07,476 INFO L244 Elim1Store]: Index analysis took 566 ms [2020-12-23 11:45:12,886 WARN L197 SmtUtils]: Spent 5.34 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2020-12-23 11:45:12,887 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2020-12-23 11:45:12,888 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 [2020-12-23 11:45:12,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:12,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:12,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:12,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:12,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:12,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:12,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:12,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:12,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:12,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:12,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:12,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:12,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:12,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:12,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:12,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:12,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:12,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:12,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:12,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:12,983 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 11:45:13,553 INFO L244 Elim1Store]: Index analysis took 528 ms [2020-12-23 11:45:18,932 WARN L197 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 413 DAG size of output: 285 [2020-12-23 11:45:18,934 INFO L348 Elim1Store]: treesize reduction 1210, result has 35.1 percent of original size [2020-12-23 11:45:18,934 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 [2020-12-23 11:45:18,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:18,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:18,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:18,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:18,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:18,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:18,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:18,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:18,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:18,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:18,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 11:45:18,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-12-23 11:45:18,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-23 11:45:18,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 11:45:18,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 11:45:18,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 11:45:18,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 11:45:18,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 11:45:18,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 11:45:18,992 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 11:45:19,010 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 11:45:19,626 INFO L244 Elim1Store]: Index analysis took 573 ms