/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-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:33:06,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:33:06,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:33:06,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:33:06,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:33:06,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:33:06,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:33:06,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:33:06,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:33:06,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:33:06,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:33:06,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:33:06,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:33:06,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:33:06,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:33:06,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:33:06,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:33:06,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:33:06,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:33:06,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:33:06,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:33:06,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:33:06,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:33:06,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:33:06,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:33:06,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:33:06,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:33:06,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:33:06,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:33:06,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:33:06,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:33:06,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:33:06,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:33:06,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:33:06,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:33:06,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:33:06,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:33:06,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:33:06,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:33:06,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:33:06,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:33:06,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:33:06,542 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:33:06,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:33:06,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:33:06,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:33:06,547 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:33:06,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:33:06,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:33:06,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:33:06,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:33:06,548 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:33:06,549 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:33:06,549 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:33:06,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:33:06,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:33:06,550 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:33:06,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:33:06,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:33:06,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:33:06,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:33:06,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:33:06,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:33:06,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:33:06,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:33:06,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:33:06,552 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 05:33:06,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:33:06,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:33:06,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:33:06,978 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:33:06,979 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:33:06,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-01-07 05:33:07,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfc7af53c/e02a914d95ce4916932b97604d2914e8/FLAGa9080feec [2021-01-07 05:33:07,787 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:33:07,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-01-07 05:33:07,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfc7af53c/e02a914d95ce4916932b97604d2914e8/FLAGa9080feec [2021-01-07 05:33:08,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfc7af53c/e02a914d95ce4916932b97604d2914e8 [2021-01-07 05:33:08,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:33:08,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:33:08,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:33:08,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:33:08,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:33:08,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aab1278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08, skipping insertion in model container [2021-01-07 05:33:08,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:33:08,162 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:33:08,481 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-simple/dll2c_update_all.i[24538,24551] [2021-01-07 05:33:08,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:33:08,494 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~last~0,],base],StructAccessExpression[IdentifierExpression[~last~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-07 05:33:08,562 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-simple/dll2c_update_all.i[24538,24551] [2021-01-07 05:33:08,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:33:08,661 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:33:08,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08 WrapperNode [2021-01-07 05:33:08,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:33:08,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:08,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:33:08,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:33:08,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:33:08,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:33:08,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:33:08,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:33:08,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (1/1) ... [2021-01-07 05:33:08,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:33:08,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:33:08,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:33:08,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:33:08,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (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 05:33:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:33:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:33:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:33:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:33:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:33:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:33:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:33:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:33:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:33:09,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:33:09,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:33:09,816 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-01-07 05:33:09,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:09 BoogieIcfgContainer [2021-01-07 05:33:09,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:33:09,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:33:09,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:33:09,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:33:09,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:33:08" (1/3) ... [2021-01-07 05:33:09,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7665b667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:09, skipping insertion in model container [2021-01-07 05:33:09,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:33:08" (2/3) ... [2021-01-07 05:33:09,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7665b667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:33:09, skipping insertion in model container [2021-01-07 05:33:09,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:09" (3/3) ... [2021-01-07 05:33:09,826 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-01-07 05:33:09,833 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:33:09,838 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 40 error locations. [2021-01-07 05:33:09,858 INFO L253 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2021-01-07 05:33:09,882 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:33:09,882 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:33:09,882 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:33:09,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:33:09,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:33:09,883 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:33:09,883 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:33:09,883 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:33:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2021-01-07 05:33:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:09,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:09,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:09,910 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2021-01-07 05:33:09,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:09,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709466911] [2021-01-07 05:33:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,121 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 05:33:10,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709466911] [2021-01-07 05:33:10,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:10,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69757236] [2021-01-07 05:33:10,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:10,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:10,147 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2021-01-07 05:33:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:10,332 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2021-01-07 05:33:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:10,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:10,345 INFO L225 Difference]: With dead ends: 115 [2021-01-07 05:33:10,345 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:33:10,347 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 05:33:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:33:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2021-01-07 05:33:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:33:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-01-07 05:33:10,392 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 4 [2021-01-07 05:33:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:10,392 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-01-07 05:33:10,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-01-07 05:33:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:33:10,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:10,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:33:10,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:33:10,401 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,402 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2021-01-07 05:33:10,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648908596] [2021-01-07 05:33:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,503 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 05:33:10,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648908596] [2021-01-07 05:33:10,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:33:10,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514642603] [2021-01-07 05:33:10,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:10,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:10,508 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 3 states. [2021-01-07 05:33:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:10,665 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-01-07 05:33:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:10,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-07 05:33:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:10,671 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:33:10,671 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:33:10,672 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 05:33:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:33:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-01-07 05:33:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:33:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-01-07 05:33:10,688 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 4 [2021-01-07 05:33:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:10,689 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-01-07 05:33:10,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-01-07 05:33:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:33:10,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:10,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:10,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:33:10,690 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash 613332465, now seen corresponding path program 1 times [2021-01-07 05:33:10,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156146167] [2021-01-07 05:33:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,792 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 05:33:10,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156146167] [2021-01-07 05:33:10,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:33:10,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390267601] [2021-01-07 05:33:10,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:33:10,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:33:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:10,796 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2021-01-07 05:33:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:10,812 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-01-07 05:33:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:33:10,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-07 05:33:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:10,814 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:33:10,815 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:33:10,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:33:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:33:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2021-01-07 05:33:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:33:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-01-07 05:33:10,824 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 10 [2021-01-07 05:33:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:10,825 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-01-07 05:33:10,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:33:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-01-07 05:33:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:10,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:10,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:10,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:33:10,826 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137848, now seen corresponding path program 1 times [2021-01-07 05:33:10,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:10,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958461342] [2021-01-07 05:33:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:10,921 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 05:33:10,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958461342] [2021-01-07 05:33:10,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:10,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:10,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677511246] [2021-01-07 05:33:10,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:10,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:10,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:10,925 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 5 states. [2021-01-07 05:33:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,181 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2021-01-07 05:33:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:11,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,188 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:33:11,188 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:33:11,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:33:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 83. [2021-01-07 05:33:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:33:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-01-07 05:33:11,205 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2021-01-07 05:33:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,206 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-01-07 05:33:11,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-01-07 05:33:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:33:11,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:33:11,210 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1103137849, now seen corresponding path program 1 times [2021-01-07 05:33:11,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49368993] [2021-01-07 05:33:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,407 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 05:33:11,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49368993] [2021-01-07 05:33:11,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:11,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028516909] [2021-01-07 05:33:11,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:33:11,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:33:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:11,416 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 5 states. [2021-01-07 05:33:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:11,639 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2021-01-07 05:33:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:11,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:33:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:11,641 INFO L225 Difference]: With dead ends: 88 [2021-01-07 05:33:11,642 INFO L226 Difference]: Without dead ends: 88 [2021-01-07 05:33:11,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-07 05:33:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2021-01-07 05:33:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:33:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2021-01-07 05:33:11,650 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 16 [2021-01-07 05:33:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:11,650 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2021-01-07 05:33:11,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:33:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2021-01-07 05:33:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:11,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:11,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:11,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:33:11,652 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash -741449383, now seen corresponding path program 1 times [2021-01-07 05:33:11,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:11,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920658672] [2021-01-07 05:33:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:11,800 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 05:33:11,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920658672] [2021-01-07 05:33:11,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:11,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:11,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345215474] [2021-01-07 05:33:11,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:11,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:11,803 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 6 states. [2021-01-07 05:33:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:12,064 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-01-07 05:33:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:12,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-07 05:33:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:12,066 INFO L225 Difference]: With dead ends: 113 [2021-01-07 05:33:12,066 INFO L226 Difference]: Without dead ends: 113 [2021-01-07 05:33:12,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-07 05:33:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-01-07 05:33:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:33:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-01-07 05:33:12,075 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 18 [2021-01-07 05:33:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:12,075 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-01-07 05:33:12,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-01-07 05:33:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:33:12,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:12,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:12,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:33:12,077 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -741449382, now seen corresponding path program 1 times [2021-01-07 05:33:12,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:12,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519435776] [2021-01-07 05:33:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,258 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 05:33:12,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519435776] [2021-01-07 05:33:12,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:12,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:33:12,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905820895] [2021-01-07 05:33:12,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:33:12,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:33:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:33:12,261 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 7 states. [2021-01-07 05:33:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:12,620 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2021-01-07 05:33:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:33:12,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2021-01-07 05:33:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:12,621 INFO L225 Difference]: With dead ends: 112 [2021-01-07 05:33:12,622 INFO L226 Difference]: Without dead ends: 112 [2021-01-07 05:33:12,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-07 05:33:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2021-01-07 05:33:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:33:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-01-07 05:33:12,629 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 18 [2021-01-07 05:33:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:12,629 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-01-07 05:33:12,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:33:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-01-07 05:33:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:33:12,630 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:12,630 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 05:33:12,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:33:12,631 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 431868768, now seen corresponding path program 1 times [2021-01-07 05:33:12,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:12,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431386864] [2021-01-07 05:33:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:12,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431386864] [2021-01-07 05:33:12,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:12,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:33:12,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216229190] [2021-01-07 05:33:12,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:12,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:12,705 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 6 states. [2021-01-07 05:33:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:12,870 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-01-07 05:33:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:12,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-07 05:33:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:12,872 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:33:12,872 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:33:12,873 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 05:33:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:33:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-01-07 05:33:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:33:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-01-07 05:33:12,878 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 20 [2021-01-07 05:33:12,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:12,879 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-01-07 05:33:12,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-01-07 05:33:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:12,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:12,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:12,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:33:12,880 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 498265101, now seen corresponding path program 1 times [2021-01-07 05:33:12,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:12,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721928280] [2021-01-07 05:33:12,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:12,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721928280] [2021-01-07 05:33:12,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626611599] [2021-01-07 05:33:12,981 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 05:33:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:13,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 05:33:13,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:13,249 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 05:33:13,251 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:33:13,413 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:13,414 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 05:33:13,419 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:13,455 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 05:33:13,458 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 05:33:13,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 05:33:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:13,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:13,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-07 05:33:13,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996774940] [2021-01-07 05:33:13,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:33:13,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:33:13,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:13,519 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 8 states. [2021-01-07 05:33:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:13,864 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-01-07 05:33:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:33:13,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2021-01-07 05:33:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:13,866 INFO L225 Difference]: With dead ends: 112 [2021-01-07 05:33:13,866 INFO L226 Difference]: Without dead ends: 112 [2021-01-07 05:33:13,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:33:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-07 05:33:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2021-01-07 05:33:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2021-01-07 05:33:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-01-07 05:33:13,871 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 21 [2021-01-07 05:33:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:13,872 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-01-07 05:33:13,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:33:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-01-07 05:33:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:33:13,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:13,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:14,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 05:33:14,088 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 498265102, now seen corresponding path program 1 times [2021-01-07 05:33:14,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:14,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724892] [2021-01-07 05:33:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:14,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724892] [2021-01-07 05:33:14,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691669196] [2021-01-07 05:33:14,285 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 05:33:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:14,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 05:33:14,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:14,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:14,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-07 05:33:14,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605158657] [2021-01-07 05:33:14,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:33:14,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:33:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:14,587 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 10 states. [2021-01-07 05:33:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:14,959 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2021-01-07 05:33:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:14,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2021-01-07 05:33:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:14,964 INFO L225 Difference]: With dead ends: 150 [2021-01-07 05:33:14,965 INFO L226 Difference]: Without dead ends: 150 [2021-01-07 05:33:14,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:33:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-01-07 05:33:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 93. [2021-01-07 05:33:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:33:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-01-07 05:33:14,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 21 [2021-01-07 05:33:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:14,974 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-01-07 05:33:14,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:33:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-01-07 05:33:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:14,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:14,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:15,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:33:15,192 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651014, now seen corresponding path program 1 times [2021-01-07 05:33:15,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:15,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360451592] [2021-01-07 05:33:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:15,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360451592] [2021-01-07 05:33:15,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:15,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:15,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603666959] [2021-01-07 05:33:15,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:15,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:15,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:15,264 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 6 states. [2021-01-07 05:33:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:15,521 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2021-01-07 05:33:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:15,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:15,523 INFO L225 Difference]: With dead ends: 111 [2021-01-07 05:33:15,523 INFO L226 Difference]: Without dead ends: 111 [2021-01-07 05:33:15,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-01-07 05:33:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2021-01-07 05:33:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:33:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-01-07 05:33:15,528 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 22 [2021-01-07 05:33:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:15,528 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-01-07 05:33:15,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-01-07 05:33:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:33:15,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:15,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:15,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:33:15,530 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1733651013, now seen corresponding path program 1 times [2021-01-07 05:33:15,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:15,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505242535] [2021-01-07 05:33:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:15,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505242535] [2021-01-07 05:33:15,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:15,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:33:15,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170028466] [2021-01-07 05:33:15,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:15,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:15,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:15,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:15,655 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 6 states. [2021-01-07 05:33:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:15,956 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-01-07 05:33:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:15,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 05:33:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:15,958 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:33:15,958 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:33:15,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:33:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:33:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-07 05:33:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:33:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-01-07 05:33:15,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 22 [2021-01-07 05:33:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:15,970 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-01-07 05:33:15,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:15,971 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-01-07 05:33:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:33:15,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:15,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:15,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:33:15,982 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1015769950, now seen corresponding path program 1 times [2021-01-07 05:33:15,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:15,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539063634] [2021-01-07 05:33:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:16,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539063634] [2021-01-07 05:33:16,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:16,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:33:16,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613931256] [2021-01-07 05:33:16,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:33:16,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:16,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:33:16,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:16,151 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2021-01-07 05:33:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:16,691 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2021-01-07 05:33:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:33:16,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2021-01-07 05:33:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:16,693 INFO L225 Difference]: With dead ends: 157 [2021-01-07 05:33:16,694 INFO L226 Difference]: Without dead ends: 157 [2021-01-07 05:33:16,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:33:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-07 05:33:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 92. [2021-01-07 05:33:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:33:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-01-07 05:33:16,697 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 27 [2021-01-07 05:33:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:16,698 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-01-07 05:33:16,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:33:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-01-07 05:33:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:33:16,699 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:16,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:16,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:33:16,699 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1015769949, now seen corresponding path program 1 times [2021-01-07 05:33:16,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:16,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312733199] [2021-01-07 05:33:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:16,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312733199] [2021-01-07 05:33:16,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:16,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:33:16,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243947766] [2021-01-07 05:33:16,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:33:16,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:33:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:16,861 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 9 states. [2021-01-07 05:33:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:17,493 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2021-01-07 05:33:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:33:17,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2021-01-07 05:33:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:17,495 INFO L225 Difference]: With dead ends: 137 [2021-01-07 05:33:17,495 INFO L226 Difference]: Without dead ends: 137 [2021-01-07 05:33:17,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:33:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-07 05:33:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 92. [2021-01-07 05:33:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:33:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-01-07 05:33:17,499 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 27 [2021-01-07 05:33:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:17,499 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-01-07 05:33:17,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:33:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-01-07 05:33:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:33:17,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:17,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:17,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:33:17,501 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1198607448, now seen corresponding path program 1 times [2021-01-07 05:33:17,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:17,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378983853] [2021-01-07 05:33:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:17,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378983853] [2021-01-07 05:33:17,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:17,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:17,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372144500] [2021-01-07 05:33:17,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:17,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:17,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:17,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:17,554 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 4 states. [2021-01-07 05:33:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:17,583 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2021-01-07 05:33:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:33:17,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2021-01-07 05:33:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:17,584 INFO L225 Difference]: With dead ends: 120 [2021-01-07 05:33:17,585 INFO L226 Difference]: Without dead ends: 120 [2021-01-07 05:33:17,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-01-07 05:33:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-01-07 05:33:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:33:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-01-07 05:33:17,588 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 29 [2021-01-07 05:33:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:17,588 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-01-07 05:33:17,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-01-07 05:33:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:33:17,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:17,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:17,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:33:17,590 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1538690034, now seen corresponding path program 1 times [2021-01-07 05:33:17,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:17,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544343432] [2021-01-07 05:33:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:17,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544343432] [2021-01-07 05:33:17,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:17,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:17,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739714160] [2021-01-07 05:33:17,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:17,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:17,636 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 4 states. [2021-01-07 05:33:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:17,685 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2021-01-07 05:33:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:17,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2021-01-07 05:33:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:17,687 INFO L225 Difference]: With dead ends: 169 [2021-01-07 05:33:17,687 INFO L226 Difference]: Without dead ends: 169 [2021-01-07 05:33:17,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-01-07 05:33:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 95. [2021-01-07 05:33:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:33:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-01-07 05:33:17,691 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 30 [2021-01-07 05:33:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:17,691 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-01-07 05:33:17,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-01-07 05:33:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:33:17,692 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:17,692 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:17,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:33:17,692 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2090471037, now seen corresponding path program 1 times [2021-01-07 05:33:17,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:17,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249310640] [2021-01-07 05:33:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:17,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249310640] [2021-01-07 05:33:17,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329570874] [2021-01-07 05:33:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:17,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:33:17,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:17,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:17,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 05:33:17,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031754773] [2021-01-07 05:33:17,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:17,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:17,944 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 4 states. [2021-01-07 05:33:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:17,956 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-01-07 05:33:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:33:17,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 05:33:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:17,958 INFO L225 Difference]: With dead ends: 82 [2021-01-07 05:33:17,958 INFO L226 Difference]: Without dead ends: 82 [2021-01-07 05:33:17,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-07 05:33:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-01-07 05:33:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:33:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-01-07 05:33:17,961 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 31 [2021-01-07 05:33:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:17,961 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-01-07 05:33:17,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-01-07 05:33:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:33:17,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:17,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:18,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 05:33:18,177 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1905462204, now seen corresponding path program 1 times [2021-01-07 05:33:18,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:18,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624253465] [2021-01-07 05:33:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:18,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624253465] [2021-01-07 05:33:18,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:18,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:33:18,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696945464] [2021-01-07 05:33:18,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:33:18,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:33:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:18,315 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 9 states. [2021-01-07 05:33:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:18,750 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-01-07 05:33:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:33:18,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2021-01-07 05:33:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:18,751 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:33:18,751 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 05:33:18,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:33:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 05:33:18,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2021-01-07 05:33:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:33:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2021-01-07 05:33:18,754 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 33 [2021-01-07 05:33:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:18,755 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-01-07 05:33:18,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:33:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2021-01-07 05:33:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:33:18,755 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:18,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:18,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:33:18,756 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1905462205, now seen corresponding path program 1 times [2021-01-07 05:33:18,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:18,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852066260] [2021-01-07 05:33:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:18,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852066260] [2021-01-07 05:33:18,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330019801] [2021-01-07 05:33:18,822 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 05:33:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:18,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:33:18,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:19,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:19,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 05:33:19,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807732050] [2021-01-07 05:33:19,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:33:19,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:33:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:19,083 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2021-01-07 05:33:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:19,136 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2021-01-07 05:33:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:19,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2021-01-07 05:33:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:19,138 INFO L225 Difference]: With dead ends: 106 [2021-01-07 05:33:19,138 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 05:33:19,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:33:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 05:33:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2021-01-07 05:33:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-07 05:33:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2021-01-07 05:33:19,141 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 33 [2021-01-07 05:33:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:19,142 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2021-01-07 05:33:19,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:33:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2021-01-07 05:33:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:19,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:19,142 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:19,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:19,357 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:19,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1019398562, now seen corresponding path program 1 times [2021-01-07 05:33:19,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:19,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830925973] [2021-01-07 05:33:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:20,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830925973] [2021-01-07 05:33:20,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815532749] [2021-01-07 05:33:20,013 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 05:33:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:20,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 66 conjunts are in the unsatisfiable core [2021-01-07 05:33:20,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:20,205 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 05:33:20,206 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:20,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:33:20,420 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:20,420 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 05:33:20,422 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,476 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-07 05:33:20,478 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2021-01-07 05:33:20,849 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 05:33:20,850 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:20,880 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:20,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2021-01-07 05:33:21,017 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:21,018 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 21 treesize of output 48 [2021-01-07 05:33:21,023 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:21,093 INFO L625 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2021-01-07 05:33:21,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:21,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2021-01-07 05:33:21,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:21,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:21,358 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:21,359 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 46 [2021-01-07 05:33:21,368 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:21,454 INFO L625 ElimStorePlain]: treesize reduction 16, result has 74.2 percent of original size [2021-01-07 05:33:21,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:21,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2021-01-07 05:33:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:21,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:21,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:21,640 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:21,640 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 73 [2021-01-07 05:33:21,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:21,719 INFO L625 ElimStorePlain]: treesize reduction 42, result has 62.5 percent of original size [2021-01-07 05:33:21,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:21,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:70 [2021-01-07 05:33:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:22,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:22,324 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:22,325 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 66 [2021-01-07 05:33:22,329 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:22,402 INFO L625 ElimStorePlain]: treesize reduction 32, result has 69.5 percent of original size [2021-01-07 05:33:22,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:22,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:70 [2021-01-07 05:33:22,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:22,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:22,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:33:22,633 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:22,634 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 37 [2021-01-07 05:33:22,636 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:22,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:22,657 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 05:33:22,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:11 [2021-01-07 05:33:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:22,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:22,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2021-01-07 05:33:22,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940231615] [2021-01-07 05:33:22,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-01-07 05:33:22,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:22,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-01-07 05:33:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:33:22,714 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 36 states. [2021-01-07 05:33:23,605 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2021-01-07 05:33:23,820 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2021-01-07 05:33:24,104 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-01-07 05:33:24,273 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-01-07 05:33:24,521 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-01-07 05:33:24,800 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-01-07 05:33:25,207 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2021-01-07 05:33:25,764 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2021-01-07 05:33:26,411 WARN L197 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 99 [2021-01-07 05:33:27,165 WARN L197 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 102 [2021-01-07 05:33:27,742 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2021-01-07 05:33:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:28,622 INFO L93 Difference]: Finished difference Result 217 states and 254 transitions. [2021-01-07 05:33:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:33:28,623 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 34 [2021-01-07 05:33:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:28,625 INFO L225 Difference]: With dead ends: 217 [2021-01-07 05:33:28,626 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 05:33:28,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2021-01-07 05:33:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 05:33:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2021-01-07 05:33:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-07 05:33:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2021-01-07 05:33:28,633 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 34 [2021-01-07 05:33:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:28,634 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2021-01-07 05:33:28,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2021-01-07 05:33:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2021-01-07 05:33:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:33:28,634 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:28,634 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:28,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:28,848 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1019398561, now seen corresponding path program 1 times [2021-01-07 05:33:28,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:28,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999406750] [2021-01-07 05:33:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:29,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999406750] [2021-01-07 05:33:29,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364528995] [2021-01-07 05:33:29,635 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 05:33:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:29,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2021-01-07 05:33:29,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:29,824 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 05:33:29,825 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:29,832 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:29,833 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:33:30,166 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:33:30,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:30,173 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,199 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 05:33:30,203 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,223 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,224 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2021-01-07 05:33:30,535 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 05:33:30,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,563 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,572 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 05:33:30,573 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,602 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2021-01-07 05:33:30,733 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2021-01-07 05:33:30,735 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2021-01-07 05:33:30,771 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:30,804 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:30,804 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2021-01-07 05:33:31,075 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,075 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 61 [2021-01-07 05:33:31,079 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:31,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 32 treesize of output 34 [2021-01-07 05:33:31,141 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:31,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,182 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:31,183 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2021-01-07 05:33:31,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,339 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,339 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 77 [2021-01-07 05:33:31,343 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:31,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:31,515 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,516 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 179 [2021-01-07 05:33:31,523 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:31,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:31,574 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 05:33:31,574 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:145 [2021-01-07 05:33:32,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,280 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:32,280 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 102 [2021-01-07 05:33:32,285 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:32,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:32,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,577 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-01-07 05:33:32,578 INFO L348 Elim1Store]: treesize reduction 72, result has 65.2 percent of original size [2021-01-07 05:33:32,578 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 198 [2021-01-07 05:33:32,585 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:32,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:32,648 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 05:33:32,648 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:186, output treesize:133 [2021-01-07 05:33:32,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:32,980 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:32,981 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 127 [2021-01-07 05:33:32,984 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:33,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:33,037 INFO L348 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2021-01-07 05:33:33,038 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 35 [2021-01-07 05:33:33,040 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:33,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:33,059 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 05:33:33,060 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:21 [2021-01-07 05:33:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:33,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:33,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2021-01-07 05:33:33,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613423144] [2021-01-07 05:33:33,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:33:33,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:33:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:33:33,340 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand 39 states. [2021-01-07 05:33:33,956 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-01-07 05:33:34,175 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-01-07 05:33:34,593 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-01-07 05:33:34,900 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-07 05:33:35,315 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-01-07 05:33:35,871 WARN L197 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2021-01-07 05:33:36,259 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2021-01-07 05:33:36,705 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-01-07 05:33:37,297 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2021-01-07 05:33:38,245 WARN L197 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 108 [2021-01-07 05:33:39,613 WARN L197 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2021-01-07 05:33:41,427 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 236 DAG size of output: 152 [2021-01-07 05:33:43,466 WARN L197 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 248 DAG size of output: 155 [2021-01-07 05:33:44,991 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 196 DAG size of output: 145 [2021-01-07 05:33:47,725 WARN L197 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 225 DAG size of output: 141 [2021-01-07 05:33:49,313 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 185 DAG size of output: 134 [2021-01-07 05:33:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:49,552 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2021-01-07 05:33:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-07 05:33:49,553 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 34 [2021-01-07 05:33:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:49,554 INFO L225 Difference]: With dead ends: 307 [2021-01-07 05:33:49,554 INFO L226 Difference]: Without dead ends: 307 [2021-01-07 05:33:49,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=461, Invalid=2619, Unknown=0, NotChecked=0, Total=3080 [2021-01-07 05:33:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-07 05:33:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 116. [2021-01-07 05:33:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-07 05:33:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-01-07 05:33:49,561 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 34 [2021-01-07 05:33:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:49,561 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-01-07 05:33:49,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:33:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-01-07 05:33:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:33:49,562 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:49,562 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:49,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:49,776 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -507168303, now seen corresponding path program 2 times [2021-01-07 05:33:49,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:49,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213844319] [2021-01-07 05:33:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:49,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213844319] [2021-01-07 05:33:49,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022496687] [2021-01-07 05:33:49,834 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 05:33:50,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:33:50,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:33:50,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:33:50,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:50,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:50,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:33:50,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314174860] [2021-01-07 05:33:50,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:50,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:33:50,107 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand 6 states. [2021-01-07 05:33:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:50,185 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2021-01-07 05:33:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:50,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2021-01-07 05:33:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:50,188 INFO L225 Difference]: With dead ends: 118 [2021-01-07 05:33:50,188 INFO L226 Difference]: Without dead ends: 118 [2021-01-07 05:33:50,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:33:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-07 05:33:50,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-01-07 05:33:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-07 05:33:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2021-01-07 05:33:50,193 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 37 [2021-01-07 05:33:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:50,193 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2021-01-07 05:33:50,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2021-01-07 05:33:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:33:50,193 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:50,194 INFO L422 BasicCegarLoop]: trace histogram [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 05:33:50,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:50,402 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash 812892342, now seen corresponding path program 2 times [2021-01-07 05:33:50,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:50,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841066317] [2021-01-07 05:33:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:33:50,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841066317] [2021-01-07 05:33:50,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768984371] [2021-01-07 05:33:50,463 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 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 05:33:50,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:33:50,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:33:50,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:33:50,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:33:50,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:50,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-01-07 05:33:50,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586113207] [2021-01-07 05:33:50,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:33:50,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:50,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:33:50,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:33:50,727 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 7 states. [2021-01-07 05:33:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:50,855 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2021-01-07 05:33:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:33:50,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2021-01-07 05:33:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:50,857 INFO L225 Difference]: With dead ends: 106 [2021-01-07 05:33:50,857 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 05:33:50,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:33:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 05:33:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2021-01-07 05:33:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-07 05:33:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2021-01-07 05:33:50,861 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 37 [2021-01-07 05:33:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:50,861 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2021-01-07 05:33:50,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:33:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2021-01-07 05:33:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:33:50,862 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:50,862 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:51,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 05:33:51,076 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 531787897, now seen corresponding path program 1 times [2021-01-07 05:33:51,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:51,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478157342] [2021-01-07 05:33:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 05:33:51,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478157342] [2021-01-07 05:33:51,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:51,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:33:51,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387785204] [2021-01-07 05:33:51,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:33:51,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:33:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:33:51,261 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand 9 states. [2021-01-07 05:33:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:51,849 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2021-01-07 05:33:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:33:51,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2021-01-07 05:33:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:51,851 INFO L225 Difference]: With dead ends: 140 [2021-01-07 05:33:51,852 INFO L226 Difference]: Without dead ends: 140 [2021-01-07 05:33:51,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:33:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-01-07 05:33:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2021-01-07 05:33:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2021-01-07 05:33:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2021-01-07 05:33:51,855 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 40 [2021-01-07 05:33:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:51,856 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2021-01-07 05:33:51,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:33:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2021-01-07 05:33:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 05:33:51,856 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:51,856 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:51,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:33:51,857 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -653629150, now seen corresponding path program 3 times [2021-01-07 05:33:51,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:51,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223659477] [2021-01-07 05:33:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:33:51,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223659477] [2021-01-07 05:33:51,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12440510] [2021-01-07 05:33:51,939 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 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 05:33:52,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-01-07 05:33:52,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:33:52,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:33:52,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:33:52,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:33:52,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2021-01-07 05:33:52,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87299526] [2021-01-07 05:33:52,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:33:52,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:33:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:52,830 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 6 states. [2021-01-07 05:33:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:52,878 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-01-07 05:33:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:33:52,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2021-01-07 05:33:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:52,880 INFO L225 Difference]: With dead ends: 100 [2021-01-07 05:33:52,880 INFO L226 Difference]: Without dead ends: 100 [2021-01-07 05:33:52,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:33:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-01-07 05:33:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-01-07 05:33:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:33:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-01-07 05:33:52,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 41 [2021-01-07 05:33:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:52,883 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-01-07 05:33:52,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:33:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-01-07 05:33:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 05:33:52,884 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:52,884 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:53,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:33:53,085 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1639408578, now seen corresponding path program 1 times [2021-01-07 05:33:53,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:53,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247065423] [2021-01-07 05:33:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:33:53,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247065423] [2021-01-07 05:33:53,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:33:53,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:33:53,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896750919] [2021-01-07 05:33:53,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:33:53,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:33:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:33:53,144 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 4 states. [2021-01-07 05:33:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:33:53,187 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2021-01-07 05:33:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:33:53,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2021-01-07 05:33:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:33:53,189 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:33:53,189 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:33:53,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:33:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:33:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2021-01-07 05:33:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:33:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2021-01-07 05:33:53,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 43 [2021-01-07 05:33:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:33:53,192 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2021-01-07 05:33:53,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:33:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2021-01-07 05:33:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:33:53,193 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:33:53,193 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:33:53,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 05:33:53,193 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:33:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:33:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash 667371338, now seen corresponding path program 1 times [2021-01-07 05:33:53,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:33:53,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825473082] [2021-01-07 05:33:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:33:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:54,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825473082] [2021-01-07 05:33:54,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48596227] [2021-01-07 05:33:54,389 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 05:33:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:33:54,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 84 conjunts are in the unsatisfiable core [2021-01-07 05:33:54,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:33:54,887 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:54,888 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:33:54,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:54,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:33:54,898 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:54,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:54,909 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:54,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-01-07 05:33:55,173 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 05:33:55,174 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,191 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,191 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-01-07 05:33:55,298 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:33:55,299 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,316 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:55,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2021-01-07 05:33:55,585 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,585 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 28 treesize of output 52 [2021-01-07 05:33:55,588 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,639 INFO L625 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2021-01-07 05:33:55,642 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 05:33:55,642 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-01-07 05:33:55,831 INFO L348 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2021-01-07 05:33:55,831 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2021-01-07 05:33:55,836 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:55,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:55,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:55,853 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2021-01-07 05:33:56,394 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_25|], 12=[|v_#memory_$Pointer$.base_41|]} [2021-01-07 05:33:56,401 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 13 treesize of output 9 [2021-01-07 05:33:56,402 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:56,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:56,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:56,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:56,534 INFO L348 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2021-01-07 05:33:56,535 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 81 [2021-01-07 05:33:56,538 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:56,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:56,560 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:33:56,561 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:51 [2021-01-07 05:33:56,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:33:56,925 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:56,925 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 47 [2021-01-07 05:33:56,931 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:56,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:56,944 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 05:33:56,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:17 [2021-01-07 05:33:57,201 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2021-01-07 05:33:57,206 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:57,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:57,224 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 05:33:57,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:13 [2021-01-07 05:33:57,594 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 19 treesize of output 7 [2021-01-07 05:33:57,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:33:57,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:33:57,602 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:33:57,603 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2021-01-07 05:33:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:33:57,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:33:57,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2021-01-07 05:33:57,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507995504] [2021-01-07 05:33:57,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-01-07 05:33:57,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:33:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-01-07 05:33:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2407, Unknown=0, NotChecked=0, Total=2550 [2021-01-07 05:33:57,901 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 51 states. [2021-01-07 05:33:59,279 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2021-01-07 05:33:59,525 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2021-01-07 05:33:59,798 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-01-07 05:34:00,046 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-07 05:34:00,293 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-01-07 05:34:00,574 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-07 05:34:00,881 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-01-07 05:34:01,278 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-01-07 05:34:01,759 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2021-01-07 05:34:02,198 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-01-07 05:34:02,589 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2021-01-07 05:34:02,951 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-01-07 05:34:03,305 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2021-01-07 05:34:03,671 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-01-07 05:34:04,135 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-01-07 05:34:04,382 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-01-07 05:34:04,646 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-01-07 05:34:04,919 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-01-07 05:34:05,198 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2021-01-07 05:34:05,532 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2021-01-07 05:34:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:06,387 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-01-07 05:34:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-07 05:34:06,388 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 44 [2021-01-07 05:34:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:06,389 INFO L225 Difference]: With dead ends: 109 [2021-01-07 05:34:06,389 INFO L226 Difference]: Without dead ends: 109 [2021-01-07 05:34:06,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=680, Invalid=5326, Unknown=0, NotChecked=0, Total=6006 [2021-01-07 05:34:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-07 05:34:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2021-01-07 05:34:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:34:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2021-01-07 05:34:06,394 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 44 [2021-01-07 05:34:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:06,394 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2021-01-07 05:34:06,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2021-01-07 05:34:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2021-01-07 05:34:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:34:06,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:06,395 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:06,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:34:06,608 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1809576850, now seen corresponding path program 1 times [2021-01-07 05:34:06,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:06,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446344616] [2021-01-07 05:34:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:07,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446344616] [2021-01-07 05:34:07,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325440403] [2021-01-07 05:34:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:07,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 67 conjunts are in the unsatisfiable core [2021-01-07 05:34:07,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:07,662 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 05:34:07,663 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,666 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,666 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:07,725 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,726 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:34:07,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:07,735 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,752 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,752 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-01-07 05:34:07,977 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 05:34:07,978 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,996 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:07,997 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:07,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-01-07 05:34:08,127 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:08,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 51 [2021-01-07 05:34:08,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:08,181 INFO L625 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2021-01-07 05:34:08,183 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:08,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:31 [2021-01-07 05:34:08,448 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:08,448 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 102 [2021-01-07 05:34:08,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:08,513 INFO L625 ElimStorePlain]: treesize reduction 22, result has 63.3 percent of original size [2021-01-07 05:34:08,515 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 05:34:08,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2021-01-07 05:34:08,688 INFO L348 Elim1Store]: treesize reduction 42, result has 54.8 percent of original size [2021-01-07 05:34:08,688 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 78 [2021-01-07 05:34:08,700 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:08,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:08,726 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:08,726 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2021-01-07 05:34:09,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:09,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:09,287 INFO L348 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2021-01-07 05:34:09,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 86 [2021-01-07 05:34:09,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:09,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:09,317 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:09,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:55 [2021-01-07 05:34:10,010 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-01-07 05:34:10,011 INFO L348 Elim1Store]: treesize reduction 10, result has 94.4 percent of original size [2021-01-07 05:34:10,011 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 206 [2021-01-07 05:34:10,017 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:34:10,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:34:10,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:10,077 INFO L625 ElimStorePlain]: treesize reduction 30, result has 64.7 percent of original size [2021-01-07 05:34:10,081 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:10,081 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:36 [2021-01-07 05:34:10,326 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-07 05:34:10,326 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2021-01-07 05:34:10,328 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:10,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:10,339 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:10,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2021-01-07 05:34:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:34:10,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:10,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2021-01-07 05:34:10,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900232060] [2021-01-07 05:34:10,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-01-07 05:34:10,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-01-07 05:34:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:34:10,561 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 41 states. [2021-01-07 05:34:11,536 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2021-01-07 05:34:11,782 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2021-01-07 05:34:12,321 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2021-01-07 05:34:12,590 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2021-01-07 05:34:12,973 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2021-01-07 05:34:13,395 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2021-01-07 05:34:13,715 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2021-01-07 05:34:14,069 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-01-07 05:34:14,364 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-07 05:34:14,869 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2021-01-07 05:34:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:15,568 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2021-01-07 05:34:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-07 05:34:15,569 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2021-01-07 05:34:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:15,570 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:34:15,570 INFO L226 Difference]: Without dead ends: 148 [2021-01-07 05:34:15,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=427, Invalid=3233, Unknown=0, NotChecked=0, Total=3660 [2021-01-07 05:34:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-07 05:34:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2021-01-07 05:34:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2021-01-07 05:34:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2021-01-07 05:34:15,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 50 [2021-01-07 05:34:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:15,575 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2021-01-07 05:34:15,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2021-01-07 05:34:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2021-01-07 05:34:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:34:15,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:15,576 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:15,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:34:15,783 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1809576851, now seen corresponding path program 1 times [2021-01-07 05:34:15,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:15,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38913073] [2021-01-07 05:34:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:16,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38913073] [2021-01-07 05:34:16,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253852642] [2021-01-07 05:34:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:17,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 78 conjunts are in the unsatisfiable core [2021-01-07 05:34:17,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:17,161 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 05:34:17,162 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,165 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:17,337 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:34:17,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:17,342 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,349 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,350 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-01-07 05:34:17,560 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 05:34:17,561 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,575 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-01-07 05:34:17,670 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:34:17,671 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:17,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:17,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:34:17,954 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:17,955 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 97 [2021-01-07 05:34:17,962 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:18,001 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2021-01-07 05:34:18,002 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 05:34:18,003 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:28 [2021-01-07 05:34:18,192 INFO L348 Elim1Store]: treesize reduction 42, result has 54.8 percent of original size [2021-01-07 05:34:18,192 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 73 [2021-01-07 05:34:18,199 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:18,215 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:18,216 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:18,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2021-01-07 05:34:18,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:18,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:18,759 INFO L348 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2021-01-07 05:34:18,760 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2021-01-07 05:34:18,764 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:18,781 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:18,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:18,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:39 [2021-01-07 05:34:19,224 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|], 12=[|v_#memory_$Pointer$.base_53|]} [2021-01-07 05:34:19,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:19,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 81 [2021-01-07 05:34:19,233 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:19,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:19,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:19,412 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-01-07 05:34:19,413 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:19,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 256 [2021-01-07 05:34:19,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:34:19,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:34:19,421 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:19,479 INFO L625 ElimStorePlain]: treesize reduction 38, result has 64.5 percent of original size [2021-01-07 05:34:19,482 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 05:34:19,482 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:141, output treesize:46 [2021-01-07 05:34:19,755 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2021-01-07 05:34:19,760 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 32 treesize of output 20 [2021-01-07 05:34:19,762 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:19,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:19,785 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-07 05:34:19,786 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 18 [2021-01-07 05:34:19,788 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:19,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:19,801 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 05:34:19,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:13 [2021-01-07 05:34:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:34:20,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:20,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2021-01-07 05:34:20,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841299775] [2021-01-07 05:34:20,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-07 05:34:20,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-07 05:34:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1779, Unknown=0, NotChecked=0, Total=1892 [2021-01-07 05:34:20,016 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 44 states. [2021-01-07 05:34:21,421 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-07 05:34:21,772 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-01-07 05:34:22,066 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-01-07 05:34:22,359 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-01-07 05:34:22,685 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-01-07 05:34:23,102 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2021-01-07 05:34:23,676 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2021-01-07 05:34:24,367 WARN L197 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2021-01-07 05:34:24,975 WARN L197 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 95 [2021-01-07 05:34:25,636 WARN L197 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2021-01-07 05:34:26,137 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-01-07 05:34:26,595 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2021-01-07 05:34:27,135 WARN L197 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2021-01-07 05:34:27,706 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 106 [2021-01-07 05:34:28,302 WARN L197 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2021-01-07 05:34:28,773 WARN L197 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2021-01-07 05:34:29,347 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2021-01-07 05:34:30,481 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2021-01-07 05:34:31,140 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2021-01-07 05:34:31,660 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2021-01-07 05:34:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:31,719 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2021-01-07 05:34:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:34:31,720 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 50 [2021-01-07 05:34:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:31,722 INFO L225 Difference]: With dead ends: 220 [2021-01-07 05:34:31,722 INFO L226 Difference]: Without dead ends: 220 [2021-01-07 05:34:31,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=568, Invalid=4124, Unknown=0, NotChecked=0, Total=4692 [2021-01-07 05:34:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-01-07 05:34:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 92. [2021-01-07 05:34:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:34:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-01-07 05:34:31,727 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 50 [2021-01-07 05:34:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:31,727 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-01-07 05:34:31,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-07 05:34:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-01-07 05:34:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:34:31,728 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:31,728 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:31,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:34:31,944 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash 211737206, now seen corresponding path program 1 times [2021-01-07 05:34:31,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:31,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826355661] [2021-01-07 05:34:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:32,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826355661] [2021-01-07 05:34:32,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426787503] [2021-01-07 05:34:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:32,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:34:32,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:32,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:32,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 05:34:32,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110911723] [2021-01-07 05:34:32,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:34:32,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:34:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:34:32,268 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 6 states. [2021-01-07 05:34:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:32,347 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-01-07 05:34:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:34:32,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2021-01-07 05:34:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:32,349 INFO L225 Difference]: With dead ends: 92 [2021-01-07 05:34:32,349 INFO L226 Difference]: Without dead ends: 92 [2021-01-07 05:34:32,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-01-07 05:34:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-01-07 05:34:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:34:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2021-01-07 05:34:32,352 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 51 [2021-01-07 05:34:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:32,353 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2021-01-07 05:34:32,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:34:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2021-01-07 05:34:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 05:34:32,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:32,354 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:32,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:32,567 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1323824412, now seen corresponding path program 2 times [2021-01-07 05:34:32,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:32,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676483451] [2021-01-07 05:34:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:32,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676483451] [2021-01-07 05:34:32,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216616049] [2021-01-07 05:34:32,641 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:32,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 05:34:32,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:34:32,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 05:34:32,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 05:34:33,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:33,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-01-07 05:34:33,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149371764] [2021-01-07 05:34:33,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:34:33,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:33,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:34:33,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:33,026 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 7 states. [2021-01-07 05:34:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:33,175 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-01-07 05:34:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:34:33,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2021-01-07 05:34:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:33,177 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:34:33,177 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:34:33,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:34:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:34:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-01-07 05:34:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:34:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-01-07 05:34:33,180 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 53 [2021-01-07 05:34:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:33,181 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-01-07 05:34:33,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:34:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-01-07 05:34:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 05:34:33,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:33,181 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:33,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:33,396 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1860545892, now seen corresponding path program 1 times [2021-01-07 05:34:33,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:33,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186258231] [2021-01-07 05:34:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:35,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186258231] [2021-01-07 05:34:35,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416766622] [2021-01-07 05:34:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:35,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 99 conjunts are in the unsatisfiable core [2021-01-07 05:34:35,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:35,287 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 05:34:35,288 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,291 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:35,292 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,292 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:35,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:35,554 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:34:35,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:35,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,565 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:35,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-01-07 05:34:35,839 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 05:34:35,841 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:35,853 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,853 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-01-07 05:34:35,960 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:34:35,962 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:35,973 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:35,975 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:35,975 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-01-07 05:34:36,237 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:36,238 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 28 treesize of output 52 [2021-01-07 05:34:36,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:36,284 INFO L625 ElimStorePlain]: treesize reduction 22, result has 56.0 percent of original size [2021-01-07 05:34:36,285 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 05:34:36,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-01-07 05:34:36,498 INFO L348 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2021-01-07 05:34:36,499 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 70 [2021-01-07 05:34:36,501 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:36,515 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:36,516 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:36,516 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:39 [2021-01-07 05:34:37,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:37,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:37,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:37,165 INFO L348 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2021-01-07 05:34:37,166 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2021-01-07 05:34:37,168 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:37,187 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:37,190 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:37,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:42 [2021-01-07 05:34:37,828 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_$Pointer$.offset_33|], 12=[|v_#memory_$Pointer$.base_59|]} [2021-01-07 05:34:37,836 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 27 treesize of output 19 [2021-01-07 05:34:37,837 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:37,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:37,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:37,876 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2021-01-07 05:34:37,879 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:37,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:38,204 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2021-01-07 05:34:38,205 INFO L348 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2021-01-07 05:34:38,205 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 260 [2021-01-07 05:34:38,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:34:38,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:34:38,212 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:38,266 INFO L625 ElimStorePlain]: treesize reduction 38, result has 62.7 percent of original size [2021-01-07 05:34:38,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:38,268 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:144, output treesize:41 [2021-01-07 05:34:38,866 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2021-01-07 05:34:38,871 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 25 treesize of output 17 [2021-01-07 05:34:38,873 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:38,890 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:38,897 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-07 05:34:38,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2021-01-07 05:34:38,899 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:38,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:38,909 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 05:34:38,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:9 [2021-01-07 05:34:39,116 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 28 treesize of output 10 [2021-01-07 05:34:39,117 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:39,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:39,126 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:39,126 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2021-01-07 05:34:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:39,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:39,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 52 [2021-01-07 05:34:39,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231388973] [2021-01-07 05:34:39,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-01-07 05:34:39,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-01-07 05:34:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2533, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 05:34:39,224 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 52 states. [2021-01-07 05:34:40,730 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2021-01-07 05:34:41,097 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2021-01-07 05:34:41,408 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-01-07 05:34:41,713 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-07 05:34:42,061 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2021-01-07 05:34:42,480 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-01-07 05:34:43,012 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2021-01-07 05:34:43,616 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2021-01-07 05:34:44,105 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2021-01-07 05:34:44,502 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2021-01-07 05:34:44,985 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2021-01-07 05:34:45,527 WARN L197 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2021-01-07 05:34:46,009 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2021-01-07 05:34:46,524 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2021-01-07 05:34:46,971 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2021-01-07 05:34:47,435 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2021-01-07 05:34:48,211 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2021-01-07 05:34:48,873 WARN L197 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2021-01-07 05:34:49,428 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2021-01-07 05:34:50,023 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2021-01-07 05:34:50,621 WARN L197 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2021-01-07 05:34:51,246 WARN L197 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2021-01-07 05:34:51,859 WARN L197 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2021-01-07 05:34:52,761 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2021-01-07 05:34:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:52,906 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2021-01-07 05:34:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-07 05:34:52,908 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 54 [2021-01-07 05:34:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:52,909 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:34:52,909 INFO L226 Difference]: Without dead ends: 101 [2021-01-07 05:34:52,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=643, Invalid=5837, Unknown=0, NotChecked=0, Total=6480 [2021-01-07 05:34:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-07 05:34:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2021-01-07 05:34:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:34:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-01-07 05:34:52,913 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 54 [2021-01-07 05:34:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:52,913 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-01-07 05:34:52,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2021-01-07 05:34:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-01-07 05:34:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 05:34:52,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:52,914 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:53,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-01-07 05:34:53,115 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 15597466, now seen corresponding path program 1 times [2021-01-07 05:34:53,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:53,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18624087] [2021-01-07 05:34:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 05:34:53,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18624087] [2021-01-07 05:34:53,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287438682] [2021-01-07 05:34:53,182 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:53,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-07 05:34:53,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:53,419 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 05:34:53,421 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:53,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:53,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:53,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:34:53,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:34:53,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 9 [2021-01-07 05:34:53,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583694862] [2021-01-07 05:34:53,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:34:53,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:53,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:34:53,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:34:53,612 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 9 states. [2021-01-07 05:34:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:54,129 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2021-01-07 05:34:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:34:54,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2021-01-07 05:34:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:54,131 INFO L225 Difference]: With dead ends: 99 [2021-01-07 05:34:54,131 INFO L226 Difference]: Without dead ends: 99 [2021-01-07 05:34:54,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:34:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-07 05:34:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2021-01-07 05:34:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:34:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-01-07 05:34:54,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 58 [2021-01-07 05:34:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:54,134 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-01-07 05:34:54,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:34:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-01-07 05:34:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 05:34:54,135 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:54,135 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:54,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:54,351 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash 15597467, now seen corresponding path program 1 times [2021-01-07 05:34:54,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:54,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442517412] [2021-01-07 05:34:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:34:54,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442517412] [2021-01-07 05:34:54,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:54,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:34:54,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152346154] [2021-01-07 05:34:54,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:34:54,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:34:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:34:54,523 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 9 states. [2021-01-07 05:34:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:55,143 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-01-07 05:34:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:34:55,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2021-01-07 05:34:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:55,144 INFO L225 Difference]: With dead ends: 82 [2021-01-07 05:34:55,144 INFO L226 Difference]: Without dead ends: 82 [2021-01-07 05:34:55,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:34:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-07 05:34:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-01-07 05:34:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:34:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2021-01-07 05:34:55,147 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 58 [2021-01-07 05:34:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:55,147 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2021-01-07 05:34:55,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:34:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2021-01-07 05:34:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 05:34:55,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:55,148 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:55,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-07 05:34:55,149 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 483555367, now seen corresponding path program 1 times [2021-01-07 05:34:55,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:55,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719213576] [2021-01-07 05:34:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:34:55,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719213576] [2021-01-07 05:34:55,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:55,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:34:55,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044449641] [2021-01-07 05:34:55,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:34:55,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:34:55,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:34:55,292 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 10 states. [2021-01-07 05:34:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:55,677 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2021-01-07 05:34:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:34:55,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2021-01-07 05:34:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:55,678 INFO L225 Difference]: With dead ends: 82 [2021-01-07 05:34:55,679 INFO L226 Difference]: Without dead ends: 82 [2021-01-07 05:34:55,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:34:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-07 05:34:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-01-07 05:34:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:34:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2021-01-07 05:34:55,683 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 59 [2021-01-07 05:34:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:55,683 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2021-01-07 05:34:55,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:34:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2021-01-07 05:34:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 05:34:55,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:55,684 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:55,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-07 05:34:55,684 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:34:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:55,684 INFO L82 PathProgramCache]: Analyzing trace with hash 807767045, now seen corresponding path program 1 times [2021-01-07 05:34:55,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:55,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450583057] [2021-01-07 05:34:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 05:34:55,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450583057] [2021-01-07 05:34:55,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962705080] [2021-01-07 05:34:55,827 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:56,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 68 conjunts are in the unsatisfiable core [2021-01-07 05:34:56,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:56,069 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 05:34:56,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:56,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:56,079 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:56,079 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:34:56,493 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:56,494 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 65 [2021-01-07 05:34:56,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2021-01-07 05:34:56,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:34:56,500 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:34:56,554 INFO L625 ElimStorePlain]: treesize reduction 52, result has 35.8 percent of original size [2021-01-07 05:34:56,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:56,557 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 05:34:56,558 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:22 [2021-01-07 05:34:57,026 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 17 treesize of output 9 [2021-01-07 05:34:57,028 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:57,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:57,046 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:57,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:11 [2021-01-07 05:34:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:34:57,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:57,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 23 [2021-01-07 05:34:57,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960584372] [2021-01-07 05:34:57,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-07 05:34:57,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-07 05:34:57,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:34:57,092 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 24 states. [2021-01-07 05:34:58,959 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2021-01-07 05:34:59,184 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-01-07 05:34:59,428 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-01-07 05:34:59,668 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-01-07 05:34:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:59,968 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2021-01-07 05:34:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:34:59,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2021-01-07 05:34:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:59,970 INFO L225 Difference]: With dead ends: 90 [2021-01-07 05:34:59,970 INFO L226 Difference]: Without dead ends: 90 [2021-01-07 05:34:59,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2021-01-07 05:34:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-01-07 05:34:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2021-01-07 05:34:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:34:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2021-01-07 05:34:59,973 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 61 [2021-01-07 05:34:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:59,974 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2021-01-07 05:34:59,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-01-07 05:34:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2021-01-07 05:34:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-07 05:34:59,974 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:59,974 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:35:00,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-01-07 05:35:00,176 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:35:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:35:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 807767046, now seen corresponding path program 1 times [2021-01-07 05:35:00,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:35:00,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425290754] [2021-01-07 05:35:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:35:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:35:01,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425290754] [2021-01-07 05:35:01,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912982337] [2021-01-07 05:35:01,685 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:35:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:01,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 102 conjunts are in the unsatisfiable core [2021-01-07 05:35:01,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:35:02,237 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_41|], 1=[|v_#valid_64|]} [2021-01-07 05:35:02,245 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 05:35:02,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,291 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,292 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:35:02,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,297 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,320 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,321 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,322 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2021-01-07 05:35:02,674 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 05:35:02,676 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,703 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,710 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 05:35:02,712 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,738 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,739 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,740 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2021-01-07 05:35:02,871 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-01-07 05:35:02,874 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:35:02,910 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:02,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,945 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:48 [2021-01-07 05:35:03,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,244 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 36 [2021-01-07 05:35:03,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,296 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2021-01-07 05:35:03,298 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,338 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:83 [2021-01-07 05:35:03,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,528 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2021-01-07 05:35:03,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:03,611 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,612 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 75 [2021-01-07 05:35:03,615 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:03,680 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 05:35:03,680 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:131 [2021-01-07 05:35:04,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,637 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2021-01-07 05:35:04,638 INFO L348 Elim1Store]: treesize reduction 68, result has 61.6 percent of original size [2021-01-07 05:35:04,639 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 165 [2021-01-07 05:35:04,643 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,735 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,736 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 102 [2021-01-07 05:35:04,739 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,796 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,802 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 05:35:04,803 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:131 [2021-01-07 05:35:05,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,076 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:05,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 98 [2021-01-07 05:35:05,080 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:05,116 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:05,118 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:05,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:64 [2021-01-07 05:35:05,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,549 INFO L348 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2021-01-07 05:35:05,549 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 74 [2021-01-07 05:35:05,552 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:05,600 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:05,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-07 05:35:05,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:05,604 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:05,605 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:05,606 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:78 [2021-01-07 05:35:05,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:05,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:05,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:06,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:07,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:07,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:07,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:07,747 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-01-07 05:35:07,929 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 1] term [2021-01-07 05:35:07,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:08,225 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-01-07 05:35:08,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:08,527 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-01-07 05:35:08,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2021-01-07 05:35:08,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:09,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:09,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:09,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:09,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:09,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:09,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:09,200 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2021-01-07 05:35:09,209 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2021-01-07 05:35:09,210 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,220 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2021-01-07 05:35:09,222 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,323 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-01-07 05:35:09,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,339 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 26 [2021-01-07 05:35:09,342 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:09,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 28 [2021-01-07 05:35:09,355 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:09,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:09,435 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:09,435 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:169, output treesize:19 [2021-01-07 05:35:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:35:09,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:09,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2021-01-07 05:35:09,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585467818] [2021-01-07 05:35:09,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-01-07 05:35:09,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-01-07 05:35:09,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2707, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:35:09,826 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 54 states. [2021-01-07 05:35:11,217 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2021-01-07 05:35:11,525 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2021-01-07 05:35:11,906 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2021-01-07 05:35:12,415 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2021-01-07 05:35:12,806 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2021-01-07 05:35:13,242 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-01-07 05:35:13,828 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2021-01-07 05:35:14,742 WARN L197 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2021-01-07 05:35:16,159 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 198 DAG size of output: 134 [2021-01-07 05:35:17,805 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 221 DAG size of output: 140 [2021-01-07 05:35:19,742 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 229 DAG size of output: 148 [2021-01-07 05:35:21,300 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 200 DAG size of output: 142 [2021-01-07 05:35:21,778 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-01-07 05:35:22,211 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-01-07 05:35:22,850 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2021-01-07 05:35:23,286 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-01-07 05:35:24,064 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2021-01-07 05:35:24,882 WARN L197 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2021-01-07 05:35:25,671 WARN L197 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2021-01-07 05:35:26,703 WARN L197 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2021-01-07 05:35:27,565 WARN L197 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2021-01-07 05:35:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:35:27,791 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2021-01-07 05:35:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:35:27,792 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 61 [2021-01-07 05:35:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:35:27,793 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:35:27,793 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:35:27,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=658, Invalid=5348, Unknown=0, NotChecked=0, Total=6006 [2021-01-07 05:35:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:35:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2021-01-07 05:35:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:35:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2021-01-07 05:35:27,798 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 61 [2021-01-07 05:35:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:35:27,798 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-01-07 05:35:27,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2021-01-07 05:35:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2021-01-07 05:35:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 05:35:27,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:35:27,799 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:35:28,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-01-07 05:35:28,015 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:35:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:35:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash -729026719, now seen corresponding path program 1 times [2021-01-07 05:35:28,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:35:28,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704708358] [2021-01-07 05:35:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:35:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:35:28,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704708358] [2021-01-07 05:35:28,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:35:28,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:35:28,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268668176] [2021-01-07 05:35:28,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:35:28,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:35:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:35:28,146 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 9 states. [2021-01-07 05:35:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:35:28,543 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-01-07 05:35:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:35:28,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2021-01-07 05:35:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:35:28,545 INFO L225 Difference]: With dead ends: 83 [2021-01-07 05:35:28,545 INFO L226 Difference]: Without dead ends: 83 [2021-01-07 05:35:28,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:35:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-07 05:35:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-01-07 05:35:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:35:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-01-07 05:35:28,548 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 62 [2021-01-07 05:35:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:35:28,548 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-01-07 05:35:28,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:35:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-01-07 05:35:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 05:35:28,549 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:35:28,549 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:35:28,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-07 05:35:28,550 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:35:28,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:35:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash -513583802, now seen corresponding path program 1 times [2021-01-07 05:35:28,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:35:28,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657181947] [2021-01-07 05:35:28,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:35:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:35:29,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657181947] [2021-01-07 05:35:29,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019630930] [2021-01-07 05:35:29,635 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:35:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:29,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 85 conjunts are in the unsatisfiable core [2021-01-07 05:35:29,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:35:30,233 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:30,234 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:35:30,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:30,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:30,245 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:30,269 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2021-01-07 05:35:30,629 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 05:35:30,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:30,662 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-01-07 05:35:30,803 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:35:30,808 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:30,838 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:30,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2021-01-07 05:35:31,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:31,103 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:35:31,105 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:31,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:31,145 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:31,145 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2021-01-07 05:35:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:31,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:31,385 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:31,386 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 123 [2021-01-07 05:35:31,390 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:31,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:31,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:31,432 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2021-01-07 05:35:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,303 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2021-01-07 05:35:32,303 INFO L348 Elim1Store]: treesize reduction 52, result has 60.9 percent of original size [2021-01-07 05:35:32,304 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 116 [2021-01-07 05:35:32,307 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:32,342 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:32,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:32,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:65 [2021-01-07 05:35:32,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:32,946 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-01-07 05:35:32,946 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:32,947 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 241 [2021-01-07 05:35:32,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2021-01-07 05:35:32,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:35:32,954 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:33,078 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2021-01-07 05:35:33,079 INFO L625 ElimStorePlain]: treesize reduction 58, result has 57.0 percent of original size [2021-01-07 05:35:33,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-07 05:35:33,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:33,083 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:35:33,086 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:33,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:96, output treesize:71 [2021-01-07 05:35:33,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:33,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:33,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:33,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:33,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:33,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:34,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:35,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:36,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:36,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:36,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:36,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:36,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:37,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:37,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:37,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:37,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:37,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:37,302 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:37,303 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 28 [2021-01-07 05:35:37,305 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:35:37,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:37,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:37,326 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:37,326 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 28 [2021-01-07 05:35:37,328 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-01-07 05:35:37,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:37,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:37,409 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:35:37,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:13 [2021-01-07 05:35:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 05:35:37,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:37,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2021-01-07 05:35:37,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299674861] [2021-01-07 05:35:37,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-01-07 05:35:37,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-01-07 05:35:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-01-07 05:35:37,641 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 45 states. [2021-01-07 05:35:38,447 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2021-01-07 05:35:39,143 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2021-01-07 05:35:39,487 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2021-01-07 05:35:39,873 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2021-01-07 05:35:40,359 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2021-01-07 05:35:40,711 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2021-01-07 05:35:41,130 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2021-01-07 05:35:41,629 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2021-01-07 05:35:42,257 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-01-07 05:35:43,088 WARN L197 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2021-01-07 05:35:43,975 WARN L197 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2021-01-07 05:35:45,025 WARN L197 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 101 [2021-01-07 05:35:45,911 WARN L197 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2021-01-07 05:35:46,286 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2021-01-07 05:35:46,612 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-07 05:35:47,302 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-01-07 05:35:47,901 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2021-01-07 05:35:48,467 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2021-01-07 05:35:49,198 WARN L197 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-01-07 05:35:49,739 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-07 05:35:50,330 WARN L197 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2021-01-07 05:35:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:35:50,531 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-01-07 05:35:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-07 05:35:50,533 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 64 [2021-01-07 05:35:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:35:50,533 INFO L225 Difference]: With dead ends: 85 [2021-01-07 05:35:50,533 INFO L226 Difference]: Without dead ends: 85 [2021-01-07 05:35:50,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 21 SyntacticMatches, 24 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=600, Invalid=4092, Unknown=0, NotChecked=0, Total=4692 [2021-01-07 05:35:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-07 05:35:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-01-07 05:35:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:35:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2021-01-07 05:35:50,537 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 64 [2021-01-07 05:35:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:35:50,538 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2021-01-07 05:35:50,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2021-01-07 05:35:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2021-01-07 05:35:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 05:35:50,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:35:50,538 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:35:50,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-01-07 05:35:50,741 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:35:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:35:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1214842779, now seen corresponding path program 1 times [2021-01-07 05:35:50,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:35:50,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648551936] [2021-01-07 05:35:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:35:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:35:51,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648551936] [2021-01-07 05:35:51,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126351434] [2021-01-07 05:35:51,603 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:35:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:35:51,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 77 conjunts are in the unsatisfiable core [2021-01-07 05:35:51,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:35:51,844 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 05:35:51,846 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:51,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:51,850 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:51,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:35:51,894 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:51,895 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:35:51,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:51,899 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:51,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:51,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:51,912 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-01-07 05:35:52,015 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 05:35:52,017 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:52,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:52,034 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:52,035 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-01-07 05:35:52,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:35:52,129 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:52,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:52,148 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:52,148 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2021-01-07 05:35:52,343 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:52,343 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 28 treesize of output 52 [2021-01-07 05:35:52,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:52,399 INFO L625 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2021-01-07 05:35:52,401 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 05:35:52,401 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-01-07 05:35:52,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:52,535 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:52,536 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 84 [2021-01-07 05:35:52,539 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:52,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:52,556 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:52,556 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2021-01-07 05:35:52,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:53,078 INFO L348 Elim1Store]: treesize reduction 28, result has 64.1 percent of original size [2021-01-07 05:35:53,078 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 77 [2021-01-07 05:35:53,081 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:53,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:53,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:53,102 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2021-01-07 05:35:53,572 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2021-01-07 05:35:53,573 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:53,573 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 180 [2021-01-07 05:35:53,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:35:53,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:53,578 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:53,623 INFO L625 ElimStorePlain]: treesize reduction 30, result has 56.5 percent of original size [2021-01-07 05:35:53,626 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:53,626 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:20 [2021-01-07 05:35:53,884 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:53,885 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2021-01-07 05:35:53,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:35:53,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:53,891 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-01-07 05:35:53,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:53,911 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:35:53,912 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:18 [2021-01-07 05:35:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:35:54,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:54,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 39 [2021-01-07 05:35:54,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394251776] [2021-01-07 05:35:54,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:35:54,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:35:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:35:54,273 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 39 states. [2021-01-07 05:35:55,377 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2021-01-07 05:35:56,064 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-07 05:35:56,371 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-01-07 05:35:56,726 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-01-07 05:35:57,021 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2021-01-07 05:35:57,359 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-01-07 05:35:57,616 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 05:35:58,403 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2021-01-07 05:35:58,597 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2021-01-07 05:35:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:35:59,035 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2021-01-07 05:35:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:35:59,036 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2021-01-07 05:35:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:35:59,037 INFO L225 Difference]: With dead ends: 82 [2021-01-07 05:35:59,037 INFO L226 Difference]: Without dead ends: 82 [2021-01-07 05:35:59,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=396, Invalid=3264, Unknown=0, NotChecked=0, Total=3660 [2021-01-07 05:35:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-07 05:35:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-01-07 05:35:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:35:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2021-01-07 05:35:59,040 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 65 [2021-01-07 05:35:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:35:59,040 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2021-01-07 05:35:59,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:35:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2021-01-07 05:35:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-07 05:35:59,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:35:59,041 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:35:59,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-01-07 05:35:59,255 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:35:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:35:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1501333782, now seen corresponding path program 1 times [2021-01-07 05:35:59,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:35:59,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170664080] [2021-01-07 05:35:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:35:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:36:01,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170664080] [2021-01-07 05:36:01,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841082256] [2021-01-07 05:36:01,047 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:01,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 99 conjunts are in the unsatisfiable core [2021-01-07 05:36:01,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:36:01,647 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:01,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:36:01,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:01,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:01,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:01,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:01,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:01,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-01-07 05:36:02,001 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 05:36:02,003 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,041 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 05:36:02,042 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,072 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,073 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-01-07 05:36:02,211 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-01-07 05:36:02,213 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,250 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 24 [2021-01-07 05:36:02,252 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,280 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,281 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,282 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2021-01-07 05:36:02,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 61 [2021-01-07 05:36:02,571 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:02,629 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:36:02,630 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,676 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:60 [2021-01-07 05:36:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:02,855 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,855 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 91 [2021-01-07 05:36:02,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:02,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:02,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:02,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:02,997 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:02,998 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 202 [2021-01-07 05:36:03,002 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:03,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:03,045 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:03,046 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:138 [2021-01-07 05:36:03,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:03,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:03,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:03,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:03,979 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2021-01-07 05:36:03,980 INFO L348 Elim1Store]: treesize reduction 76, result has 61.8 percent of original size [2021-01-07 05:36:03,981 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 183 [2021-01-07 05:36:03,985 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:04,057 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,088 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:04,089 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 102 [2021-01-07 05:36:04,091 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:04,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:04,145 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 05:36:04,146 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:126 [2021-01-07 05:36:04,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:04,983 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:04,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 166 treesize of output 186 [2021-01-07 05:36:04,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:05,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:05,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:05,151 INFO L348 Elim1Store]: treesize reduction 64, result has 42.3 percent of original size [2021-01-07 05:36:05,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 117 [2021-01-07 05:36:05,154 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:05,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:05,210 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 05:36:05,211 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:207, output treesize:138 [2021-01-07 05:36:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:05,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:05,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:05,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:36:05,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:36:06,021 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:06,022 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 126 treesize of output 138 [2021-01-07 05:36:06,025 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:36:06,026 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:36:06,028 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:36:06,030 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 05:36:06,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:06,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:06,138 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:06,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 69 [2021-01-07 05:36:06,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:36:06,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:36:06,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:06,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:06,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:06,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:06,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:06,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:06,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:06,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:06,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:06,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:06,159 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2021-01-07 05:36:06,279 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-01-07 05:36:06,279 INFO L625 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2021-01-07 05:36:06,282 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:06,282 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:166, output treesize:28 [2021-01-07 05:36:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 05:36:06,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:36:06,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 54 [2021-01-07 05:36:06,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875491715] [2021-01-07 05:36:06,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-01-07 05:36:06,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:36:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-01-07 05:36:06,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2702, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:36:06,951 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 54 states. [2021-01-07 05:36:08,357 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-01-07 05:36:08,733 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-01-07 05:36:09,079 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2021-01-07 05:36:09,466 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2021-01-07 05:36:09,971 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 61 [2021-01-07 05:36:10,748 WARN L197 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2021-01-07 05:36:11,892 WARN L197 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 119 [2021-01-07 05:36:13,101 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 176 DAG size of output: 123 [2021-01-07 05:36:14,565 WARN L197 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 189 DAG size of output: 127 [2021-01-07 05:36:15,797 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 176 DAG size of output: 123 [2021-01-07 05:36:17,162 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 188 DAG size of output: 125 [2021-01-07 05:36:18,904 WARN L197 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 203 DAG size of output: 150 [2021-01-07 05:36:20,768 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 213 DAG size of output: 160 [2021-01-07 05:36:22,566 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 213 DAG size of output: 160 [2021-01-07 05:36:24,529 WARN L197 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 224 DAG size of output: 165 [2021-01-07 05:36:26,476 WARN L197 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 224 DAG size of output: 165 [2021-01-07 05:36:28,292 WARN L197 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 209 DAG size of output: 150 [2021-01-07 05:36:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:36:28,501 INFO L93 Difference]: Finished difference Result 73 states and 72 transitions. [2021-01-07 05:36:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:36:28,502 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 67 [2021-01-07 05:36:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:36:28,503 INFO L225 Difference]: With dead ends: 73 [2021-01-07 05:36:28,503 INFO L226 Difference]: Without dead ends: 73 [2021-01-07 05:36:28,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=714, Invalid=4986, Unknown=0, NotChecked=0, Total=5700 [2021-01-07 05:36:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-07 05:36:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-01-07 05:36:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-07 05:36:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 72 transitions. [2021-01-07 05:36:28,506 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 72 transitions. Word has length 67 [2021-01-07 05:36:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:36:28,507 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 72 transitions. [2021-01-07 05:36:28,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2021-01-07 05:36:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 72 transitions. [2021-01-07 05:36:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 05:36:28,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:36:28,508 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:36:28,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:28,723 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:36:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:36:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 327205690, now seen corresponding path program 1 times [2021-01-07 05:36:28,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:36:28,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641622802] [2021-01-07 05:36:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:36:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:36:29,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641622802] [2021-01-07 05:36:29,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142164537] [2021-01-07 05:36:29,906 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:30,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:36:30,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:36:30,170 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 05:36:30,172 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:30,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:30,175 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:30,175 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:36:30,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:30,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:30,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:30,917 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:30,917 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 05:36:30,919 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:30,931 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 05:36:30,933 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:31,016 INFO L625 ElimStorePlain]: treesize reduction 23, result has 54.0 percent of original size [2021-01-07 05:36:31,017 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 2 xjuncts. [2021-01-07 05:36:31,018 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:24 [2021-01-07 05:36:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 05:36:31,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:36:31,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 34 [2021-01-07 05:36:31,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857790529] [2021-01-07 05:36:31,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-01-07 05:36:31,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:36:31,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-01-07 05:36:31,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2021-01-07 05:36:31,250 INFO L87 Difference]: Start difference. First operand 73 states and 72 transitions. Second operand 35 states. [2021-01-07 05:36:32,117 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-01-07 05:36:32,896 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2021-01-07 05:36:33,250 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-01-07 05:36:34,273 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-07 05:36:34,514 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2021-01-07 05:36:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:36:34,793 INFO L93 Difference]: Finished difference Result 72 states and 71 transitions. [2021-01-07 05:36:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:36:34,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2021-01-07 05:36:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:36:34,795 INFO L225 Difference]: With dead ends: 72 [2021-01-07 05:36:34,795 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:36:34,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=378, Invalid=2484, Unknown=0, NotChecked=0, Total=2862 [2021-01-07 05:36:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:36:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-01-07 05:36:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-07 05:36:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 71 transitions. [2021-01-07 05:36:34,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 71 transitions. Word has length 69 [2021-01-07 05:36:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:36:34,798 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 71 transitions. [2021-01-07 05:36:34,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-01-07 05:36:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 71 transitions. [2021-01-07 05:36:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-07 05:36:34,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:36:34,799 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:36:35,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:35,001 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2021-01-07 05:36:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:36:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 912062464, now seen corresponding path program 1 times [2021-01-07 05:36:35,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:36:35,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873374624] [2021-01-07 05:36:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:36:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 05:36:36,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873374624] [2021-01-07 05:36:36,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162348132] [2021-01-07 05:36:36,805 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:36:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:36:37,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 78 conjunts are in the unsatisfiable core [2021-01-07 05:36:37,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:36:37,164 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:37,164 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 63 [2021-01-07 05:36:37,167 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:37,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:37,208 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:37,208 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:31 [2021-01-07 05:36:37,694 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 05:36:37,696 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:37,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:37,734 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:36:37,735 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2021-01-07 05:36:37,881 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2021-01-07 05:36:37,883 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:37,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:37,924 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:37,925 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2021-01-07 05:36:38,264 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:38,265 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 28 treesize of output 52 [2021-01-07 05:36:38,267 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:38,369 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2021-01-07 05:36:38,370 INFO L625 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2021-01-07 05:36:38,372 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 05:36:38,372 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2021-01-07 05:36:38,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:38,551 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:38,552 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 94 [2021-01-07 05:36:38,555 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:38,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:38,598 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:38,598 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2021-01-07 05:36:39,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:39,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:39,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:39,450 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-01-07 05:36:39,451 INFO L348 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2021-01-07 05:36:39,451 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 91 [2021-01-07 05:36:39,455 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:39,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:39,504 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:39,504 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2021-01-07 05:36:40,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:40,338 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-01-07 05:36:40,339 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:40,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 200 [2021-01-07 05:36:40,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:36:40,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:36:40,345 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:40,448 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-01-07 05:36:40,449 INFO L625 ElimStorePlain]: treesize reduction 34, result has 70.9 percent of original size [2021-01-07 05:36:40,453 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 05:36:40,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:100, output treesize:62 [2021-01-07 05:36:40,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:36:40,953 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:40,953 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 39 [2021-01-07 05:36:40,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:40,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:40,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:40,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:40,959 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 05:36:41,018 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:41,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:36:41,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:41,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:41,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:36:41,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:36:41,027 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2021-01-07 05:36:41,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:36:41,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:75 [2021-01-07 05:36:41,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:36:41,208 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:36:42,451 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:36:42,527 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:42,528 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 05:36:42,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:42,548 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 0 case distinctions, treesize of input 17 treesize of output 17 [2021-01-07 05:36:42,550 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:42,615 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:42,616 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 05:36:42,618 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:42,881 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2021-01-07 05:36:42,886 INFO L625 ElimStorePlain]: treesize reduction 52, result has 66.2 percent of original size [2021-01-07 05:36:42,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:42,895 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2021-01-07 05:36:42,896 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:106, output treesize:102 [2021-01-07 05:36:42,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:42,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:43,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:43,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:36:43,624 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:43,625 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:36:43,627 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:36:43,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:36:43,650 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 05:36:43,650 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2021-01-07 05:36:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:36:43,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:36:43,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2021-01-07 05:36:43,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957888725] [2021-01-07 05:36:43,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-01-07 05:36:43,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:36:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-01-07 05:36:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2054, Unknown=0, NotChecked=0, Total=2162 [2021-01-07 05:36:43,887 INFO L87 Difference]: Start difference. First operand 72 states and 71 transitions. Second operand 47 states. [2021-01-07 05:36:45,433 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2021-01-07 05:36:45,758 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2021-01-07 05:36:46,134 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2021-01-07 05:36:46,641 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2021-01-07 05:36:46,996 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2021-01-07 05:36:47,472 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2021-01-07 05:36:48,005 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2021-01-07 05:36:48,739 WARN L197 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2021-01-07 05:36:49,695 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 74 [2021-01-07 05:36:50,906 WARN L197 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 83 [2021-01-07 05:36:51,697 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 80 [2021-01-07 05:36:52,701 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2021-01-07 05:36:53,127 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2021-01-07 05:36:53,533 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2021-01-07 05:36:54,088 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 33 [2021-01-07 05:36:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:36:54,561 INFO L93 Difference]: Finished difference Result 71 states and 70 transitions. [2021-01-07 05:36:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:36:54,561 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 71 [2021-01-07 05:36:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:36:54,564 INFO L225 Difference]: With dead ends: 71 [2021-01-07 05:36:54,564 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 05:36:54,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=354, Invalid=4202, Unknown=0, NotChecked=0, Total=4556 [2021-01-07 05:36:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 05:36:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 05:36:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 05:36:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 05:36:54,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2021-01-07 05:36:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:36:54,566 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 05:36:54,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2021-01-07 05:36:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 05:36:54,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 05:36:54,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-01-07 05:36:54,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 05:36:54 BoogieIcfgContainer [2021-01-07 05:36:54,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 05:36:54,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 05:36:54,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 05:36:54,778 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 05:36:54,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:33:09" (3/4) ... [2021-01-07 05:36:54,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 05:36:54,799 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-01-07 05:36:54,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-01-07 05:36:54,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-07 05:36:54,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-07 05:36:54,874 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-simple/dll2c_update_all.i-witness.graphml [2021-01-07 05:36:54,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 05:36:54,875 INFO L168 Benchmark]: Toolchain (without parser) took 226799.08 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 107.5 MB in the beginning and 142.8 MB in the end (delta: -35.3 MB). Peak memory consumption was 76.9 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,875 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:36:54,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.06 ms. Allocated memory is still 151.0 MB. Free memory was 107.3 MB in the beginning and 114.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.23 ms. Allocated memory is still 151.0 MB. Free memory was 114.5 MB in the beginning and 130.8 MB in the end (delta: -16.2 MB). Peak memory consumption was 2.7 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,877 INFO L168 Benchmark]: Boogie Preprocessor took 93.73 ms. Allocated memory is still 151.0 MB. Free memory was 130.8 MB in the beginning and 128.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,877 INFO L168 Benchmark]: RCFGBuilder took 924.71 ms. Allocated memory is still 151.0 MB. Free memory was 128.7 MB in the beginning and 93.4 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,877 INFO L168 Benchmark]: TraceAbstraction took 224957.84 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 93.0 MB in the beginning and 147.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 58.5 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,877 INFO L168 Benchmark]: Witness Printer took 96.86 ms. Allocated memory is still 262.1 MB. Free memory was 147.0 MB in the beginning and 142.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-07 05:36:54,882 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 583.06 ms. Allocated memory is still 151.0 MB. Free memory was 107.3 MB in the beginning and 114.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 131.23 ms. Allocated memory is still 151.0 MB. Free memory was 114.5 MB in the beginning and 130.8 MB in the end (delta: -16.2 MB). Peak memory consumption was 2.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 93.73 ms. Allocated memory is still 151.0 MB. Free memory was 130.8 MB in the beginning and 128.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 924.71 ms. Allocated memory is still 151.0 MB. Free memory was 128.7 MB in the beginning and 93.4 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 224957.84 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 93.0 MB in the beginning and 147.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 58.5 MB. Max. memory is 8.0 GB. * Witness Printer took 96.86 ms. Allocated memory is still 262.1 MB. Free memory was 147.0 MB in the beginning and 142.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 621]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 580]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 617]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 621]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 40 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 224.8s, OverallIterations: 43, TraceHistogramMax: 3, AutomataDifference: 143.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2187 SDtfs, 18658 SDslu, 11859 SDs, 0 SdLazy, 19424 SolverSat, 1697 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1984 GetRequests, 839 SyntacticMatches, 71 SemanticMatches, 1074 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9414 ImplicationChecksByTransitivity, 159.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=21, 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, 43 MinimizatonAttempts, 1061 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 69.7s InterpolantComputationTime, 2772 NumberOfCodeBlocks, 2772 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2706 ConstructedInterpolants, 214 QuantifiedInterpolants, 2543004 SizeOfPredicates, 504 NumberOfNonLiveVariables, 6962 ConjunctsInSsa, 1081 ConjunctsInUnsatCore, 66 InterpolantComputations, 23 PerfectInterpolantSequences, 469/725 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...