/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-MemCleanup-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:55:44,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:55:44,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:55:44,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:55:44,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:55:44,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:55:44,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:55:44,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:55:44,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:55:44,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:55:44,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:55:44,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:55:44,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:55:44,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:55:44,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:55:44,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:55:44,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:55:44,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:55:44,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:55:44,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:55:44,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:55:44,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:55:44,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:55:44,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:55:44,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:55:44,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:55:44,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:55:44,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:55:44,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:55:44,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:55:44,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:55:44,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:55:44,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:55:44,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:55:44,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:55:44,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:55:44,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:55:44,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:55:44,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:55:44,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:55:44,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:55:44,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Default.epf [2021-01-07 04:55:44,647 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:55:44,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:55:44,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:55:44,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:55:44,653 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:55:44,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:55:44,654 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 04:55:44,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:55:44,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:55:44,655 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 04:55:44,656 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 04:55:44,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:55:44,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 04:55:44,657 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:55:44,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:55:44,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:55:44,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:55:44,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:55:44,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:55:44,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:55:44,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:55:44,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:55:44,660 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:55:44,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 04:55:45,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:55:45,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:55:45,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:55:45,117 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:55:45,117 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:55:45,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2021-01-07 04:55:45,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8bf6dcdc/111b5aac5605425da3671075a6bbf2d1/FLAG176dcbf66 [2021-01-07 04:55:45,867 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:55:45,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2021-01-07 04:55:45,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8bf6dcdc/111b5aac5605425da3671075a6bbf2d1/FLAG176dcbf66 [2021-01-07 04:55:46,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8bf6dcdc/111b5aac5605425da3671075a6bbf2d1 [2021-01-07 04:55:46,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:55:46,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:55:46,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:55:46,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:55:46,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:55:46,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2b67e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46, skipping insertion in model container [2021-01-07 04:55:46,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:55:46,200 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~second_to_last~0,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_node~0,],base],StructAccessExpression[IdentifierExpression[~new_node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~second_to_last~0,],base],StructAccessExpression[IdentifierExpression[~second_to_last~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~head,] [2021-01-07 04:55:46,557 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/list-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2021-01-07 04:55:46,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:55:46,573 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: lhs: VariableLHS[~second_to_last~0,] left hand side expression in assignment: lhs: VariableLHS[~last~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_node~0,],base],StructAccessExpression[IdentifierExpression[~new_node~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~second_to_last~0,],base],StructAccessExpression[IdentifierExpression[~second_to_last~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~head,] [2021-01-07 04:55:46,625 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/list-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2021-01-07 04:55:46,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:55:46,699 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:55:46,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46 WrapperNode [2021-01-07 04:55:46,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:55:46,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:55:46,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:55:46,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:55:46,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:55:46,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:55:46,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:55:46,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:55:46,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... [2021-01-07 04:55:46,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:55:46,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:55:46,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:55:46,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:55:46,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:55:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:55:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:55:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:55:46,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:55:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:55:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 04:55:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:55:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:55:46,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:55:47,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:55:47,616 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-01-07 04:55:47,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:55:47 BoogieIcfgContainer [2021-01-07 04:55:47,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:55:47,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:55:47,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:55:47,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:55:47,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:55:46" (1/3) ... [2021-01-07 04:55:47,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d7da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:55:47, skipping insertion in model container [2021-01-07 04:55:47,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:55:46" (2/3) ... [2021-01-07 04:55:47,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d7da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:55:47, skipping insertion in model container [2021-01-07 04:55:47,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:55:47" (3/3) ... [2021-01-07 04:55:47,633 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2021-01-07 04:55:47,647 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:55:47,653 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2021-01-07 04:55:47,674 INFO L253 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-01-07 04:55:47,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:55:47,701 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 04:55:47,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:55:47,701 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:55:47,701 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:55:47,701 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:55:47,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:55:47,702 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:55:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2021-01-07 04:55:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 04:55:47,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:47,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:47,730 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 217248027, now seen corresponding path program 1 times [2021-01-07 04:55:47,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:47,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017478733] [2021-01-07 04:55:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:47,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017478733] [2021-01-07 04:55:47,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:47,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:47,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949105374] [2021-01-07 04:55:47,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:55:47,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:55:47,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:55:47,932 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2021-01-07 04:55:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:47,954 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2021-01-07 04:55:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:55:47,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-07 04:55:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:47,967 INFO L225 Difference]: With dead ends: 88 [2021-01-07 04:55:47,967 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 04:55:47,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:55:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 04:55:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-01-07 04:55:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 04:55:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2021-01-07 04:55:48,012 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 9 [2021-01-07 04:55:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:48,012 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2021-01-07 04:55:48,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:55:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2021-01-07 04:55:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 04:55:48,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:48,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:48,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:55:48,014 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2109896044, now seen corresponding path program 1 times [2021-01-07 04:55:48,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:48,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050618003] [2021-01-07 04:55:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:48,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050618003] [2021-01-07 04:55:48,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:48,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:48,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690993214] [2021-01-07 04:55:48,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:48,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:48,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:48,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:48,103 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 3 states. [2021-01-07 04:55:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:48,256 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2021-01-07 04:55:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:48,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-07 04:55:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:48,260 INFO L225 Difference]: With dead ends: 153 [2021-01-07 04:55:48,260 INFO L226 Difference]: Without dead ends: 153 [2021-01-07 04:55:48,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-01-07 04:55:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 83. [2021-01-07 04:55:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 04:55:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2021-01-07 04:55:48,273 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 11 [2021-01-07 04:55:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:48,273 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2021-01-07 04:55:48,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2021-01-07 04:55:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 04:55:48,274 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:48,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:48,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:55:48,275 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2109896043, now seen corresponding path program 1 times [2021-01-07 04:55:48,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:48,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847713705] [2021-01-07 04:55:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:48,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847713705] [2021-01-07 04:55:48,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:48,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:48,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577421910] [2021-01-07 04:55:48,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:48,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:48,386 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 3 states. [2021-01-07 04:55:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:48,489 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2021-01-07 04:55:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:48,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-07 04:55:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:48,492 INFO L225 Difference]: With dead ends: 154 [2021-01-07 04:55:48,492 INFO L226 Difference]: Without dead ends: 154 [2021-01-07 04:55:48,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-07 04:55:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 82. [2021-01-07 04:55:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 04:55:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2021-01-07 04:55:48,508 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 11 [2021-01-07 04:55:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:48,508 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2021-01-07 04:55:48,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2021-01-07 04:55:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 04:55:48,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:48,513 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] [2021-01-07 04:55:48,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 04:55:48,513 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1637235172, now seen corresponding path program 1 times [2021-01-07 04:55:48,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:48,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238364468] [2021-01-07 04:55:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:48,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238364468] [2021-01-07 04:55:48,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:48,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:55:48,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393731479] [2021-01-07 04:55:48,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:55:48,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:55:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:55:48,632 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 6 states. [2021-01-07 04:55:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:48,724 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2021-01-07 04:55:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:55:48,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 04:55:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:48,726 INFO L225 Difference]: With dead ends: 96 [2021-01-07 04:55:48,726 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 04:55:48,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 04:55:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2021-01-07 04:55:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 04:55:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2021-01-07 04:55:48,747 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 20 [2021-01-07 04:55:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:48,748 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2021-01-07 04:55:48,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:55:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2021-01-07 04:55:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:48,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:48,752 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] [2021-01-07 04:55:48,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 04:55:48,753 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash -637204731, now seen corresponding path program 1 times [2021-01-07 04:55:48,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:48,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993940912] [2021-01-07 04:55:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:55:48,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993940912] [2021-01-07 04:55:48,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:48,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:55:48,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647707989] [2021-01-07 04:55:48,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:55:48,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:55:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:55:48,922 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 6 states. [2021-01-07 04:55:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:49,088 INFO L93 Difference]: Finished difference Result 194 states and 218 transitions. [2021-01-07 04:55:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:55:49,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-07 04:55:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:49,090 INFO L225 Difference]: With dead ends: 194 [2021-01-07 04:55:49,091 INFO L226 Difference]: Without dead ends: 194 [2021-01-07 04:55:49,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-07 04:55:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-07 04:55:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 97. [2021-01-07 04:55:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 04:55:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2021-01-07 04:55:49,100 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 23 [2021-01-07 04:55:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:49,101 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2021-01-07 04:55:49,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:55:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2021-01-07 04:55:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:49,102 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:49,102 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] [2021-01-07 04:55:49,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 04:55:49,103 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash -637202809, now seen corresponding path program 1 times [2021-01-07 04:55:49,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:49,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262498464] [2021-01-07 04:55:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:55:49,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262498464] [2021-01-07 04:55:49,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:49,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:55:49,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877708905] [2021-01-07 04:55:49,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:49,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:49,192 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 3 states. [2021-01-07 04:55:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:49,250 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2021-01-07 04:55:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:49,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-07 04:55:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:49,252 INFO L225 Difference]: With dead ends: 107 [2021-01-07 04:55:49,252 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 04:55:49,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:55:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 04:55:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2021-01-07 04:55:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 04:55:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2021-01-07 04:55:49,276 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 23 [2021-01-07 04:55:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:49,276 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2021-01-07 04:55:49,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2021-01-07 04:55:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:49,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:49,277 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] [2021-01-07 04:55:49,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 04:55:49,281 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash -637202808, now seen corresponding path program 1 times [2021-01-07 04:55:49,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:49,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024603801] [2021-01-07 04:55:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:55:49,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024603801] [2021-01-07 04:55:49,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:49,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:49,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597329635] [2021-01-07 04:55:49,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:55:49,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:55:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:55:49,416 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 7 states. [2021-01-07 04:55:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:49,551 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2021-01-07 04:55:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:55:49,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2021-01-07 04:55:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:49,553 INFO L225 Difference]: With dead ends: 142 [2021-01-07 04:55:49,553 INFO L226 Difference]: Without dead ends: 142 [2021-01-07 04:55:49,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:55:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-07 04:55:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 106. [2021-01-07 04:55:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-01-07 04:55:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2021-01-07 04:55:49,558 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 23 [2021-01-07 04:55:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:49,559 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2021-01-07 04:55:49,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:55:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2021-01-07 04:55:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 04:55:49,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:49,560 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] [2021-01-07 04:55:49,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 04:55:49,561 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1446549434, now seen corresponding path program 1 times [2021-01-07 04:55:49,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:49,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834097530] [2021-01-07 04:55:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:49,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834097530] [2021-01-07 04:55:49,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299149881] [2021-01-07 04:55:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:49,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-07 04:55:49,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:49,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:55:49,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2021-01-07 04:55:49,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226528238] [2021-01-07 04:55:49,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:55:49,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:55:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:49,869 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 7 states. [2021-01-07 04:55:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:50,040 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2021-01-07 04:55:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:55:50,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2021-01-07 04:55:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:50,042 INFO L225 Difference]: With dead ends: 109 [2021-01-07 04:55:50,043 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 04:55:50,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:55:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 04:55:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2021-01-07 04:55:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 04:55:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2021-01-07 04:55:50,048 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 23 [2021-01-07 04:55:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:50,048 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2021-01-07 04:55:50,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:55:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2021-01-07 04:55:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 04:55:50,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:50,050 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:50,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-01-07 04:55:50,265 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1490473361, now seen corresponding path program 1 times [2021-01-07 04:55:50,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:50,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258747505] [2021-01-07 04:55:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:50,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258747505] [2021-01-07 04:55:50,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965897257] [2021-01-07 04:55:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:50,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 04:55:50,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:50,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:50,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-01-07 04:55:50,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160836049] [2021-01-07 04:55:50,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 04:55:50,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 04:55:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:55:50,631 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 11 states. [2021-01-07 04:55:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:50,828 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2021-01-07 04:55:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 04:55:50,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2021-01-07 04:55:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:50,830 INFO L225 Difference]: With dead ends: 119 [2021-01-07 04:55:50,830 INFO L226 Difference]: Without dead ends: 119 [2021-01-07 04:55:50,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2021-01-07 04:55:50,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-07 04:55:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99. [2021-01-07 04:55:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-07 04:55:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-01-07 04:55:50,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 25 [2021-01-07 04:55:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:50,835 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-01-07 04:55:50,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 04:55:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-01-07 04:55:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 04:55:50,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:50,836 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:51,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:51,050 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -704088865, now seen corresponding path program 2 times [2021-01-07 04:55:51,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:51,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040963323] [2021-01-07 04:55:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 04:55:51,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040963323] [2021-01-07 04:55:51,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162219083] [2021-01-07 04:55:51,153 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:51,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:55:51,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:55:51,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 04:55:51,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:51,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:51,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:51,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:51,296 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:51,297 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 04:55:51,346 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:51,347 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:51,351 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:51,374 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:51,377 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:51,377 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:51,426 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:51,426 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:51,429 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:51,445 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:51,447 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:51,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:55:51,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:55:51,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2021-01-07 04:55:51,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894963458] [2021-01-07 04:55:51,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:55:51,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:55:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:55:51,491 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2021-01-07 04:55:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:51,530 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2021-01-07 04:55:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:55:51,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-01-07 04:55:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:51,532 INFO L225 Difference]: With dead ends: 97 [2021-01-07 04:55:51,532 INFO L226 Difference]: Without dead ends: 97 [2021-01-07 04:55:51,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:55:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-01-07 04:55:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-01-07 04:55:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 04:55:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2021-01-07 04:55:51,535 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 30 [2021-01-07 04:55:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:51,536 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2021-01-07 04:55:51,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:55:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2021-01-07 04:55:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 04:55:51,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:51,537 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:51,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:55:51,751 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1108999016, now seen corresponding path program 1 times [2021-01-07 04:55:51,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:51,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936761088] [2021-01-07 04:55:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 04:55:51,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936761088] [2021-01-07 04:55:51,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:51,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:51,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891235841] [2021-01-07 04:55:51,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:51,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:51,842 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 8 states. [2021-01-07 04:55:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:52,110 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2021-01-07 04:55:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:55:52,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2021-01-07 04:55:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:52,114 INFO L225 Difference]: With dead ends: 182 [2021-01-07 04:55:52,114 INFO L226 Difference]: Without dead ends: 182 [2021-01-07 04:55:52,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:55:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-07 04:55:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2021-01-07 04:55:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-07 04:55:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2021-01-07 04:55:52,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 33 [2021-01-07 04:55:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:52,119 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2021-01-07 04:55:52,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2021-01-07 04:55:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 04:55:52,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:52,121 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:52,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 04:55:52,121 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1108999017, now seen corresponding path program 1 times [2021-01-07 04:55:52,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:52,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339921454] [2021-01-07 04:55:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:55:52,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339921454] [2021-01-07 04:55:52,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:52,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:55:52,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159250492] [2021-01-07 04:55:52,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:52,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:52,257 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 8 states. [2021-01-07 04:55:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:52,598 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2021-01-07 04:55:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:55:52,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2021-01-07 04:55:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:52,600 INFO L225 Difference]: With dead ends: 172 [2021-01-07 04:55:52,600 INFO L226 Difference]: Without dead ends: 172 [2021-01-07 04:55:52,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:55:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-01-07 04:55:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 105. [2021-01-07 04:55:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-07 04:55:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2021-01-07 04:55:52,604 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 33 [2021-01-07 04:55:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:52,604 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2021-01-07 04:55:52,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2021-01-07 04:55:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 04:55:52,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:52,606 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:52,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 04:55:52,606 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1299757381, now seen corresponding path program 1 times [2021-01-07 04:55:52,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:52,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024229547] [2021-01-07 04:55:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:55:52,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024229547] [2021-01-07 04:55:52,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:55:52,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 04:55:52,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965384737] [2021-01-07 04:55:52,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:55:52,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:55:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:55:52,679 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand 8 states. [2021-01-07 04:55:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:52,833 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2021-01-07 04:55:52,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:55:52,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2021-01-07 04:55:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:52,836 INFO L225 Difference]: With dead ends: 151 [2021-01-07 04:55:52,837 INFO L226 Difference]: Without dead ends: 151 [2021-01-07 04:55:52,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-07 04:55:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-07 04:55:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2021-01-07 04:55:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-01-07 04:55:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2021-01-07 04:55:52,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 36 [2021-01-07 04:55:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:52,843 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2021-01-07 04:55:52,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:55:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2021-01-07 04:55:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 04:55:52,849 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:52,849 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:52,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 04:55:52,849 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1301389675, now seen corresponding path program 1 times [2021-01-07 04:55:52,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:52,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992740744] [2021-01-07 04:55:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:52,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992740744] [2021-01-07 04:55:53,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951217868] [2021-01-07 04:55:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:53,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 04:55:53,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:53,112 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:53,113 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,115 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,115 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 04:55:53,145 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,145 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:53,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,163 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 04:55:53,163 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,164 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-01-07 04:55:53,197 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:53,198 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,209 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2021-01-07 04:55:53,346 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-01-07 04:55:53,349 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:53,357 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,365 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:53,365 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:36 [2021-01-07 04:55:53,490 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2021-01-07 04:55:53,493 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 04:55:53,498 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 04:55:53,500 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:53,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:53,519 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:53,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:11 [2021-01-07 04:55:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:53,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:53,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2021-01-07 04:55:53,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081891312] [2021-01-07 04:55:53,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 04:55:53,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 04:55:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-07 04:55:53,548 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 19 states. [2021-01-07 04:55:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:54,580 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2021-01-07 04:55:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 04:55:54,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2021-01-07 04:55:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:54,582 INFO L225 Difference]: With dead ends: 188 [2021-01-07 04:55:54,582 INFO L226 Difference]: Without dead ends: 188 [2021-01-07 04:55:54,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2021-01-07 04:55:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-07 04:55:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 108. [2021-01-07 04:55:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 04:55:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2021-01-07 04:55:54,588 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 36 [2021-01-07 04:55:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:54,588 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2021-01-07 04:55:54,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 04:55:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2021-01-07 04:55:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 04:55:54,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:54,589 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:54,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:54,803 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1301389676, now seen corresponding path program 1 times [2021-01-07 04:55:54,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:54,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286395017] [2021-01-07 04:55:54,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:55,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286395017] [2021-01-07 04:55:55,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040224246] [2021-01-07 04:55:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:55,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjunts are in the unsatisfiable core [2021-01-07 04:55:55,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:55,183 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:55:55,184 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,189 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,189 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 04:55:55,240 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,240 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 04:55:55,244 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,262 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2021-01-07 04:55:55,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-01-07 04:55:55,300 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:55,301 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,319 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:55,320 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,336 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,337 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2021-01-07 04:55:55,663 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,663 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 55 [2021-01-07 04:55:55,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:55:55,669 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:55:55,671 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:55,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,697 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:55,697 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2021-01-07 04:55:55,701 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:55:55,706 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:55:55,712 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:55:55,722 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:55,745 INFO L625 ElimStorePlain]: treesize reduction 6, result has 81.3 percent of original size [2021-01-07 04:55:55,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:55,751 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:14 [2021-01-07 04:55:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:55,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:55,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2021-01-07 04:55:55,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81005670] [2021-01-07 04:55:55,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 04:55:55,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:55,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 04:55:55,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-01-07 04:55:55,788 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 22 states. [2021-01-07 04:55:56,346 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2021-01-07 04:55:56,593 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-01-07 04:55:56,829 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2021-01-07 04:55:57,083 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2021-01-07 04:55:57,335 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2021-01-07 04:55:57,569 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-01-07 04:55:58,120 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-01-07 04:55:58,362 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-01-07 04:55:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:55:58,523 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2021-01-07 04:55:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 04:55:58,523 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2021-01-07 04:55:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:55:58,525 INFO L225 Difference]: With dead ends: 216 [2021-01-07 04:55:58,525 INFO L226 Difference]: Without dead ends: 216 [2021-01-07 04:55:58,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=378, Invalid=1028, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 04:55:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-07 04:55:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 108. [2021-01-07 04:55:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 04:55:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-01-07 04:55:58,530 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 36 [2021-01-07 04:55:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:55:58,535 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-01-07 04:55:58,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 04:55:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-01-07 04:55:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 04:55:58,536 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:55:58,536 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:55:58,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 04:55:58,754 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:55:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:55:58,755 INFO L82 PathProgramCache]: Analyzing trace with hash -971460510, now seen corresponding path program 1 times [2021-01-07 04:55:58,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:55:58,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879458910] [2021-01-07 04:55:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:55:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:58,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879458910] [2021-01-07 04:55:58,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588523152] [2021-01-07 04:55:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:55:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:55:59,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjunts are in the unsatisfiable core [2021-01-07 04:55:59,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:55:59,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:55:59,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:59,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:59,072 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:59,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-01-07 04:55:59,200 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2021-01-07 04:55:59,202 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:59,210 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:59,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:55:59,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:26 [2021-01-07 04:55:59,312 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:59,312 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2021-01-07 04:55:59,315 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:55:59,321 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:55:59,323 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:55:59,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:4 [2021-01-07 04:55:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:55:59,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:55:59,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2021-01-07 04:55:59,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145509642] [2021-01-07 04:55:59,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 04:55:59,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:55:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 04:55:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-01-07 04:55:59,338 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 19 states. [2021-01-07 04:56:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:00,193 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2021-01-07 04:56:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 04:56:00,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2021-01-07 04:56:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:00,195 INFO L225 Difference]: With dead ends: 159 [2021-01-07 04:56:00,195 INFO L226 Difference]: Without dead ends: 159 [2021-01-07 04:56:00,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2021-01-07 04:56:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-07 04:56:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2021-01-07 04:56:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 04:56:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2021-01-07 04:56:00,200 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 39 [2021-01-07 04:56:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:00,200 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2021-01-07 04:56:00,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 04:56:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2021-01-07 04:56:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-07 04:56:00,201 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:00,201 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:00,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:00,415 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -969828216, now seen corresponding path program 2 times [2021-01-07 04:56:00,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:00,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670818305] [2021-01-07 04:56:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:56:00,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670818305] [2021-01-07 04:56:00,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933568001] [2021-01-07 04:56:00,712 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:00,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:56:00,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:56:00,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 67 conjunts are in the unsatisfiable core [2021-01-07 04:56:00,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:00,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:56:00,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:00,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:00,873 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:56:00,876 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:00,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:00,885 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:56:00,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2021-01-07 04:56:00,970 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:56:00,971 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:00,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:00,982 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:56:00,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2021-01-07 04:56:01,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:01,058 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:01,059 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2021-01-07 04:56:01,061 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:01,116 INFO L625 ElimStorePlain]: treesize reduction 12, result has 81.8 percent of original size [2021-01-07 04:56:01,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:01,135 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:01,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2021-01-07 04:56:01,141 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:01,198 INFO L625 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2021-01-07 04:56:01,200 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:56:01,200 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:64 [2021-01-07 04:56:01,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:56:01,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:56:02,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:02,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:02,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:56:02,151 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,152 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 110 [2021-01-07 04:56:02,157 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,158 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,159 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,161 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,163 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,164 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,166 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,168 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,169 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,170 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,173 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,175 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,179 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,182 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,184 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,185 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,186 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,188 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,189 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,192 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,194 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,196 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,199 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,200 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,205 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,217 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,219 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,221 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,227 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,230 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,232 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 04:56:02,237 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,238 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,240 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 04:56:02,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,247 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,249 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,251 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,252 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,254 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 04:56:02,258 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,258 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,266 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,266 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,268 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,270 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,271 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,276 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,278 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,281 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,283 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,285 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,291 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,294 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,295 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,297 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 04:56:02,303 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:02,404 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2021-01-07 04:56:02,405 INFO L625 ElimStorePlain]: treesize reduction 44, result has 84.2 percent of original size [2021-01-07 04:56:02,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 04:56:02,434 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,435 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2021-01-07 04:56:02,437 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,472 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,499 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,499 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 125 [2021-01-07 04:56:02,503 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,504 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,505 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,507 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,508 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,509 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,511 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,511 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,513 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,516 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,517 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,518 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,520 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,522 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,527 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,528 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,534 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,534 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,536 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,540 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,541 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,546 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,547 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,553 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,555 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,557 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,558 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,559 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,560 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,561 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,563 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,566 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,567 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,568 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,570 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,571 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,578 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,602 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,605 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,607 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,608 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 04:56:02,613 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,614 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 04:56:02,618 INFO L547 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:02,720 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-07 04:56:02,721 INFO L625 ElimStorePlain]: treesize reduction 16, result has 89.8 percent of original size [2021-01-07 04:56:02,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:02,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 85 [2021-01-07 04:56:02,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,749 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,750 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,750 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,752 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,756 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,758 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,759 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 04:56:02,760 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,763 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,765 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 4 disjuncts [2021-01-07 04:56:02,766 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,766 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,768 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,770 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:56:02,771 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 04:56:02,778 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 04:56:02,785 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,793 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 04:56:02,796 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,802 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,803 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,807 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 4 disjuncts [2021-01-07 04:56:02,808 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,809 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,811 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:56:02,813 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:56:02,820 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 04:56:02,825 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,826 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 04:56:02,830 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,834 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 04:56:02,835 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-07 04:56:02,838 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2021-01-07 04:56:02,839 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,840 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,841 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,843 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,844 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,847 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,848 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2021-01-07 04:56:02,849 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 04:56:02,850 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2021-01-07 04:56:02,851 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 04:56:02,865 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:02,952 INFO L625 ElimStorePlain]: treesize reduction 27, result has 71.6 percent of original size [2021-01-07 04:56:02,959 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-01-07 04:56:02,959 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:345, output treesize:25 [2021-01-07 04:56:03,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:03,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:56:03,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:03,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2021-01-07 04:56:03,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921440453] [2021-01-07 04:56:03,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 04:56:03,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:03,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 04:56:03,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=868, Unknown=0, NotChecked=0, Total=930 [2021-01-07 04:56:03,208 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 31 states. [2021-01-07 04:56:04,339 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-01-07 04:56:04,704 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-01-07 04:56:05,358 WARN L197 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2021-01-07 04:56:06,093 WARN L197 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 94 [2021-01-07 04:56:06,845 WARN L197 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 96 [2021-01-07 04:56:07,808 WARN L197 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 102 [2021-01-07 04:56:08,588 WARN L197 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 94 [2021-01-07 04:56:09,611 WARN L197 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 102 [2021-01-07 04:56:10,328 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2021-01-07 04:56:10,929 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2021-01-07 04:56:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:14,130 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2021-01-07 04:56:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 04:56:14,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2021-01-07 04:56:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:14,132 INFO L225 Difference]: With dead ends: 203 [2021-01-07 04:56:14,132 INFO L226 Difference]: Without dead ends: 203 [2021-01-07 04:56:14,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2021-01-07 04:56:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-01-07 04:56:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 142. [2021-01-07 04:56:14,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-07 04:56:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 165 transitions. [2021-01-07 04:56:14,138 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 165 transitions. Word has length 39 [2021-01-07 04:56:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:14,138 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 165 transitions. [2021-01-07 04:56:14,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 04:56:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 165 transitions. [2021-01-07 04:56:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 04:56:14,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:14,139 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:14,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 04:56:14,355 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1882747466, now seen corresponding path program 1 times [2021-01-07 04:56:14,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:14,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643831466] [2021-01-07 04:56:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:56:14,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643831466] [2021-01-07 04:56:14,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511259573] [2021-01-07 04:56:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 04:56:14,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:14,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:14,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 04:56:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:56:14,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:14,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-01-07 04:56:14,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675374631] [2021-01-07 04:56:14,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 04:56:14,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 04:56:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-07 04:56:14,653 INFO L87 Difference]: Start difference. First operand 142 states and 165 transitions. Second operand 13 states. [2021-01-07 04:56:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:15,058 INFO L93 Difference]: Finished difference Result 490 states and 548 transitions. [2021-01-07 04:56:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 04:56:15,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2021-01-07 04:56:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:15,061 INFO L225 Difference]: With dead ends: 490 [2021-01-07 04:56:15,061 INFO L226 Difference]: Without dead ends: 490 [2021-01-07 04:56:15,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-01-07 04:56:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-01-07 04:56:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 179. [2021-01-07 04:56:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 04:56:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2021-01-07 04:56:15,069 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 40 [2021-01-07 04:56:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:15,070 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2021-01-07 04:56:15,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 04:56:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2021-01-07 04:56:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 04:56:15,071 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:15,071 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:15,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 04:56:15,285 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1132356152, now seen corresponding path program 1 times [2021-01-07 04:56:15,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:15,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022453795] [2021-01-07 04:56:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:56:15,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022453795] [2021-01-07 04:56:15,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800549247] [2021-01-07 04:56:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:15,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-07 04:56:15,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:15,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:56:15,584 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:15,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:15,589 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:56:15,589 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 04:56:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:15,613 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 04:56:15,614 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:15,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:15,622 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:15,623 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2021-01-07 04:56:15,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:15,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:15,683 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:15,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 04:56:15,686 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:15,711 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2021-01-07 04:56:15,715 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:15,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2021-01-07 04:56:15,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:15,859 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:15,860 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2021-01-07 04:56:15,864 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:15,894 INFO L625 ElimStorePlain]: treesize reduction 28, result has 42.9 percent of original size [2021-01-07 04:56:15,896 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:15,896 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2021-01-07 04:56:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:56:15,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:15,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2021-01-07 04:56:15,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062128614] [2021-01-07 04:56:15,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 04:56:15,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 04:56:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:56:15,948 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand 15 states. [2021-01-07 04:56:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:16,214 INFO L93 Difference]: Finished difference Result 219 states and 255 transitions. [2021-01-07 04:56:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:56:16,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2021-01-07 04:56:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:16,216 INFO L225 Difference]: With dead ends: 219 [2021-01-07 04:56:16,216 INFO L226 Difference]: Without dead ends: 219 [2021-01-07 04:56:16,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2021-01-07 04:56:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-01-07 04:56:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 177. [2021-01-07 04:56:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2021-01-07 04:56:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 208 transitions. [2021-01-07 04:56:16,222 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 208 transitions. Word has length 40 [2021-01-07 04:56:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:16,222 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 208 transitions. [2021-01-07 04:56:16,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 04:56:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2021-01-07 04:56:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 04:56:16,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:16,223 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:16,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:16,438 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1132356153, now seen corresponding path program 1 times [2021-01-07 04:56:16,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:16,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205290358] [2021-01-07 04:56:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:56:16,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205290358] [2021-01-07 04:56:16,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635343678] [2021-01-07 04:56:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:16,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 04:56:16,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:16,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 04:56:16,721 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:16,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:16,728 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:56:16,728 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 04:56:16,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:16,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-01-07 04:56:16,757 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:16,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:16,767 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:16,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2021-01-07 04:56:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:16,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:16,852 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:16,852 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 04:56:16,854 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:16,887 INFO L625 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2021-01-07 04:56:16,889 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:16,890 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2021-01-07 04:56:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 04:56:17,050 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:56:17,050 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2021-01-07 04:56:17,052 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:56:17,090 INFO L625 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2021-01-07 04:56:17,092 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 04:56:17,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2021-01-07 04:56:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 04:56:17,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:17,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2021-01-07 04:56:17,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676753606] [2021-01-07 04:56:17,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 04:56:17,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 04:56:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-01-07 04:56:17,157 INFO L87 Difference]: Start difference. First operand 177 states and 208 transitions. Second operand 15 states. [2021-01-07 04:56:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:17,495 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2021-01-07 04:56:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:56:17,496 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2021-01-07 04:56:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:17,497 INFO L225 Difference]: With dead ends: 231 [2021-01-07 04:56:17,497 INFO L226 Difference]: Without dead ends: 231 [2021-01-07 04:56:17,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2021-01-07 04:56:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-07 04:56:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 175. [2021-01-07 04:56:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-07 04:56:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2021-01-07 04:56:17,504 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 40 [2021-01-07 04:56:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:17,505 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2021-01-07 04:56:17,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 04:56:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2021-01-07 04:56:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 04:56:17,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:17,506 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:17,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:17,721 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash 91129893, now seen corresponding path program 2 times [2021-01-07 04:56:17,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:17,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156512567] [2021-01-07 04:56:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:56:17,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156512567] [2021-01-07 04:56:17,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212867384] [2021-01-07 04:56:17,955 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:18,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:56:18,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:56:18,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 04:56:18,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:56:18,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:18,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-01-07 04:56:18,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908759963] [2021-01-07 04:56:18,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 04:56:18,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 04:56:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-01-07 04:56:18,156 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand 13 states. [2021-01-07 04:56:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:18,471 INFO L93 Difference]: Finished difference Result 394 states and 445 transitions. [2021-01-07 04:56:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 04:56:18,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2021-01-07 04:56:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:18,474 INFO L225 Difference]: With dead ends: 394 [2021-01-07 04:56:18,474 INFO L226 Difference]: Without dead ends: 394 [2021-01-07 04:56:18,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2021-01-07 04:56:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-01-07 04:56:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 208. [2021-01-07 04:56:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-07 04:56:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2021-01-07 04:56:18,482 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 42 [2021-01-07 04:56:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:18,483 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2021-01-07 04:56:18,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 04:56:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2021-01-07 04:56:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:56:18,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:18,484 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:18,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-07 04:56:18,700 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1128380089, now seen corresponding path program 1 times [2021-01-07 04:56:18,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:18,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505175839] [2021-01-07 04:56:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:56:18,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505175839] [2021-01-07 04:56:18,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:56:18,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:56:18,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563891529] [2021-01-07 04:56:18,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:56:18,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:56:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:56:18,735 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 3 states. [2021-01-07 04:56:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:18,783 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2021-01-07 04:56:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:56:18,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:56:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:18,785 INFO L225 Difference]: With dead ends: 237 [2021-01-07 04:56:18,785 INFO L226 Difference]: Without dead ends: 237 [2021-01-07 04:56:18,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:56:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-07 04:56:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2021-01-07 04:56:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-07 04:56:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2021-01-07 04:56:18,791 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 44 [2021-01-07 04:56:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:18,791 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2021-01-07 04:56:18,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:56:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2021-01-07 04:56:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:56:18,792 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:18,792 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:18,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 04:56:18,793 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1128380088, now seen corresponding path program 1 times [2021-01-07 04:56:18,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:18,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531817791] [2021-01-07 04:56:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:56:18,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531817791] [2021-01-07 04:56:18,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:56:18,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:56:18,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397039911] [2021-01-07 04:56:18,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:56:18,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:56:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:56:18,831 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 3 states. [2021-01-07 04:56:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:18,871 INFO L93 Difference]: Finished difference Result 238 states and 273 transitions. [2021-01-07 04:56:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:56:18,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:56:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:18,873 INFO L225 Difference]: With dead ends: 238 [2021-01-07 04:56:18,873 INFO L226 Difference]: Without dead ends: 238 [2021-01-07 04:56:18,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:56:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-01-07 04:56:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2021-01-07 04:56:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-07 04:56:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2021-01-07 04:56:18,878 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 44 [2021-01-07 04:56:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:18,879 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2021-01-07 04:56:18,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:56:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2021-01-07 04:56:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:56:18,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:18,880 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:18,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 04:56:18,880 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1128380034, now seen corresponding path program 1 times [2021-01-07 04:56:18,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:18,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975431742] [2021-01-07 04:56:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 04:56:18,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975431742] [2021-01-07 04:56:18,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:56:18,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:56:18,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157707516] [2021-01-07 04:56:18,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:56:18,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:18,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:56:18,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:56:18,927 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand 6 states. [2021-01-07 04:56:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:18,999 INFO L93 Difference]: Finished difference Result 275 states and 313 transitions. [2021-01-07 04:56:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:56:19,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-07 04:56:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:19,001 INFO L225 Difference]: With dead ends: 275 [2021-01-07 04:56:19,001 INFO L226 Difference]: Without dead ends: 275 [2021-01-07 04:56:19,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:56:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-07 04:56:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 218. [2021-01-07 04:56:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 04:56:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2021-01-07 04:56:19,007 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 44 [2021-01-07 04:56:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:19,007 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2021-01-07 04:56:19,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:56:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2021-01-07 04:56:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:56:19,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:19,008 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:19,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 04:56:19,009 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -282829994, now seen corresponding path program 3 times [2021-01-07 04:56:19,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:19,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661679511] [2021-01-07 04:56:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 04:56:19,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661679511] [2021-01-07 04:56:19,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662644810] [2021-01-07 04:56:19,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:56:19,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-07 04:56:19,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:56:19,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 04:56:19,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:56:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 04:56:19,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 04:56:19,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-01-07 04:56:19,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176392955] [2021-01-07 04:56:19,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 04:56:19,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 04:56:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-07 04:56:19,279 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand 12 states. [2021-01-07 04:56:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:19,523 INFO L93 Difference]: Finished difference Result 370 states and 418 transitions. [2021-01-07 04:56:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 04:56:19,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2021-01-07 04:56:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:19,525 INFO L225 Difference]: With dead ends: 370 [2021-01-07 04:56:19,526 INFO L226 Difference]: Without dead ends: 370 [2021-01-07 04:56:19,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-01-07 04:56:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-07 04:56:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 191. [2021-01-07 04:56:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-01-07 04:56:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2021-01-07 04:56:19,533 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 44 [2021-01-07 04:56:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:19,533 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2021-01-07 04:56:19,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 04:56:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2021-01-07 04:56:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 04:56:19,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:19,534 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:19,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 04:56:19,749 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash 432514138, now seen corresponding path program 1 times [2021-01-07 04:56:19,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:19,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140715354] [2021-01-07 04:56:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 04:56:19,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140715354] [2021-01-07 04:56:19,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:56:19,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:56:19,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944522106] [2021-01-07 04:56:19,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:56:19,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:19,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:56:19,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:56:19,820 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 8 states. [2021-01-07 04:56:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:20,060 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2021-01-07 04:56:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 04:56:20,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2021-01-07 04:56:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:20,062 INFO L225 Difference]: With dead ends: 252 [2021-01-07 04:56:20,062 INFO L226 Difference]: Without dead ends: 252 [2021-01-07 04:56:20,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-07 04:56:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-01-07 04:56:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 200. [2021-01-07 04:56:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2021-01-07 04:56:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2021-01-07 04:56:20,068 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 45 [2021-01-07 04:56:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:20,068 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2021-01-07 04:56:20,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:56:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2021-01-07 04:56:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 04:56:20,069 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:20,069 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:20,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 04:56:20,069 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 432514139, now seen corresponding path program 1 times [2021-01-07 04:56:20,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:20,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911449143] [2021-01-07 04:56:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:56:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 04:56:20,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911449143] [2021-01-07 04:56:20,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:56:20,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 04:56:20,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586129555] [2021-01-07 04:56:20,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:56:20,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:56:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:56:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:56:20,177 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand 8 states. [2021-01-07 04:56:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:56:20,469 INFO L93 Difference]: Finished difference Result 252 states and 288 transitions. [2021-01-07 04:56:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:56:20,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2021-01-07 04:56:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:56:20,471 INFO L225 Difference]: With dead ends: 252 [2021-01-07 04:56:20,471 INFO L226 Difference]: Without dead ends: 252 [2021-01-07 04:56:20,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-07 04:56:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-01-07 04:56:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2021-01-07 04:56:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2021-01-07 04:56:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 236 transitions. [2021-01-07 04:56:20,477 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 236 transitions. Word has length 45 [2021-01-07 04:56:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:56:20,478 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 236 transitions. [2021-01-07 04:56:20,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:56:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 236 transitions. [2021-01-07 04:56:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 04:56:20,479 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:56:20,479 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:56:20,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 04:56:20,479 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 04:56:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:56:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1181974787, now seen corresponding path program 1 times [2021-01-07 04:56:20,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:56:20,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923329868] [2021-01-07 04:56:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:56:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 04:56:20,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 04:56:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 04:56:20,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-07 04:56:20,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-07 04:56:20,545 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-07 04:56:20,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 04:56:20,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 04:56:20 BoogieIcfgContainer [2021-01-07 04:56:20,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 04:56:20,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 04:56:20,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 04:56:20,632 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 04:56:20,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:55:47" (3/4) ... [2021-01-07 04:56:20,635 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-07 04:56:20,718 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert-1.i-witness.graphml [2021-01-07 04:56:20,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 04:56:20,719 INFO L168 Benchmark]: Toolchain (without parser) took 34578.67 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 125.6 MB in the beginning and 155.3 MB in the end (delta: -29.8 MB). Peak memory consumption was 59.2 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,719 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 124.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 04:56:20,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.95 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 101.8 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.51 ms. Allocated memory is still 151.0 MB. Free memory was 101.8 MB in the beginning and 99.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,720 INFO L168 Benchmark]: Boogie Preprocessor took 47.73 ms. Allocated memory is still 151.0 MB. Free memory was 99.4 MB in the beginning and 97.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,720 INFO L168 Benchmark]: RCFGBuilder took 810.76 ms. Allocated memory is still 151.0 MB. Free memory was 97.7 MB in the beginning and 125.3 MB in the end (delta: -27.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,721 INFO L168 Benchmark]: TraceAbstraction took 33010.93 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 124.7 MB in the beginning and 160.1 MB in the end (delta: -35.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,721 INFO L168 Benchmark]: Witness Printer took 86.10 ms. Allocated memory is still 239.1 MB. Free memory was 160.1 MB in the beginning and 155.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-07 04:56:20,723 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 124.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 557.95 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 101.8 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.51 ms. Allocated memory is still 151.0 MB. Free memory was 101.8 MB in the beginning and 99.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.73 ms. Allocated memory is still 151.0 MB. Free memory was 99.4 MB in the beginning and 97.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 810.76 ms. Allocated memory is still 151.0 MB. Free memory was 97.7 MB in the beginning and 125.3 MB in the end (delta: -27.5 MB). Peak memory consumption was 30.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 33010.93 ms. Allocated memory was 151.0 MB in the beginning and 239.1 MB in the end (delta: 88.1 MB). Free memory was 124.7 MB in the beginning and 160.1 MB in the end (delta: -35.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 8.0 GB. * Witness Printer took 86.10 ms. Allocated memory is still 239.1 MB. Free memory was 160.1 MB in the beginning and 155.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L620] int len = from; [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L627] const int len = _get_nondet_int(2, 5); [L628] SLL s = sll_create(len); [L575] SLL head = ((void *)0); [L576] EXPR len-- [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->next = head [L582] head = new_head [L576] EXPR len-- [L576] COND FALSE !(len-- > 0) [L584] return head; [L628] SLL s = sll_create(len); [L620] int len = from; [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() [L621] COND TRUE len < until && __VERIFIER_nondet_int() [L622] len++ [L621] len < until && __VERIFIER_nondet_int() [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L629] const int k = _get_nondet_int(0, len - 1); [L630] int i = 0; [L631] i < k && __VERIFIER_nondet_int() [L631] i < k && __VERIFIER_nondet_int() [L631] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L636] EXPR \read(s) [L587] int len = 0; [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND FALSE !(\read(head)) [L592] return len; [L636] COND TRUE k + len != sll_length(s) [L641] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 25 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.8s, OverallIterations: 28, TraceHistogramMax: 4, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2283 SDtfs, 10172 SDslu, 9462 SDs, 0 SdLazy, 4258 SolverSat, 495 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 412 SyntacticMatches, 9 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 1814 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1357 NumberOfCodeBlocks, 1357 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1273 ConstructedInterpolants, 79 QuantifiedInterpolants, 474911 SizeOfPredicates, 157 NumberOfNonLiveVariables, 2360 ConjunctsInSsa, 319 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 261/380 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...