/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/dll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:34:42,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:34:42,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:34:42,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:34:42,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:34:42,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:34:42,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:34:42,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:34:42,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:34:42,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:34:42,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:34:42,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:34:42,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:34:42,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:34:42,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:34:42,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:34:42,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:34:42,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:34:42,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:34:42,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:34:42,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:34:42,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:34:42,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:34:42,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:34:42,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:34:42,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:34:42,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:34:42,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:34:42,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:34:42,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:34:42,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:34:42,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:34:42,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:34:42,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:34:42,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:34:42,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:34:42,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:34:42,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:34:42,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:34:42,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:34:42,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:34:42,997 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:34:43,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:34:43,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:34:43,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:34:43,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:34:43,059 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:34:43,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:34:43,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:34:43,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:34:43,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:34:43,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:34:43,061 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:34:43,061 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:34:43,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:34:43,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:34:43,062 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:34:43,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:34:43,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:34:43,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:34:43,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:34:43,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:34:43,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:34:43,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:34:43,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:34:43,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:34:43,064 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:34:43,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:34:43,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:34:43,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:34:43,549 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:34:43,550 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:34:43,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-01-07 05:34:43,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/783e3cac4/d2aded5ff296439682cf03e6bf99c145/FLAG7dd45a83d [2021-01-07 05:34:44,469 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:34:44,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-01-07 05:34:44,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/783e3cac4/d2aded5ff296439682cf03e6bf99c145/FLAG7dd45a83d [2021-01-07 05:34:44,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/783e3cac4/d2aded5ff296439682cf03e6bf99c145 [2021-01-07 05:34:44,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:34:44,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:34:44,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:34:44,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:34:44,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:34:44,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:34:44" (1/1) ... [2021-01-07 05:34:44,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431d5bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:44, skipping insertion in model container [2021-01-07 05:34:44,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:34:44" (1/1) ... [2021-01-07 05:34:44,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:34:44,801 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] 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[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-07 05:34:45,093 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/dll2n_prepend_equal.i[24361,24374] [2021-01-07 05:34:45,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:34:45,105 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~temp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~temp~0,],offset]]]] 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[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~head,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] [2021-01-07 05:34:45,195 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/dll2n_prepend_equal.i[24361,24374] [2021-01-07 05:34:45,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:34:45,274 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:34:45,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45 WrapperNode [2021-01-07 05:34:45,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:34:45,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:34:45,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:34:45,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:34:45,287 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:34:45" (1/1) ... [2021-01-07 05:34:45,356 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:34:45" (1/1) ... [2021-01-07 05:34:45,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:34:45,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:34:45,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:34:45,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:34:45,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... [2021-01-07 05:34:45,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:34:45,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:34:45,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:34:45,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:34:45,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:34:45,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:34:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:34:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:34:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:34:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:34:45,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:34:46,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:34:46,073 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-07 05:34:46,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:34:46 BoogieIcfgContainer [2021-01-07 05:34:46,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:34:46,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:34:46,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:34:46,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:34:46,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:34:44" (1/3) ... [2021-01-07 05:34:46,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a29dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:34:46, skipping insertion in model container [2021-01-07 05:34:46,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:34:45" (2/3) ... [2021-01-07 05:34:46,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a29dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:34:46, skipping insertion in model container [2021-01-07 05:34:46,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:34:46" (3/3) ... [2021-01-07 05:34:46,091 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2021-01-07 05:34:46,099 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:34:46,107 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2021-01-07 05:34:46,133 INFO L253 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-01-07 05:34:46,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:34:46,172 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:34:46,172 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:34:46,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:34:46,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:34:46,172 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:34:46,172 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:34:46,172 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:34:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2021-01-07 05:34:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:34:46,209 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:46,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:34:46,210 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2021-01-07 05:34:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:46,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292466961] [2021-01-07 05:34:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:46,518 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:34:46,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292466961] [2021-01-07 05:34:46,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:46,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:34:46,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753695608] [2021-01-07 05:34:46,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:46,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:34:46,546 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 3 states. [2021-01-07 05:34:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:46,738 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2021-01-07 05:34:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:46,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:34:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:46,751 INFO L225 Difference]: With dead ends: 157 [2021-01-07 05:34:46,751 INFO L226 Difference]: Without dead ends: 152 [2021-01-07 05:34:46,753 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:34:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-01-07 05:34:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 84. [2021-01-07 05:34:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:34:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-01-07 05:34:46,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2021-01-07 05:34:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:46,796 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-01-07 05:34:46,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-01-07 05:34:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:34:46,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:46,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:34:46,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:34:46,798 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:46,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2021-01-07 05:34:46,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:46,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891244461] [2021-01-07 05:34:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:46,863 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:34:46,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891244461] [2021-01-07 05:34:46,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:46,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:34:46,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168007767] [2021-01-07 05:34:46,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:46,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:34:46,868 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2021-01-07 05:34:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:47,032 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2021-01-07 05:34:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:47,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:34:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:47,037 INFO L225 Difference]: With dead ends: 151 [2021-01-07 05:34:47,038 INFO L226 Difference]: Without dead ends: 151 [2021-01-07 05:34:47,039 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:34:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-01-07 05:34:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 81. [2021-01-07 05:34:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:34:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2021-01-07 05:34:47,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2021-01-07 05:34:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:47,065 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2021-01-07 05:34:47,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2021-01-07 05:34:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-07 05:34:47,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:47,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:47,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:34:47,067 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1809644651, now seen corresponding path program 1 times [2021-01-07 05:34:47,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:47,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724606466] [2021-01-07 05:34:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,125 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:34:47,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724606466] [2021-01-07 05:34:47,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:47,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:34:47,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376923422] [2021-01-07 05:34:47,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:47,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:47,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:47,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:34:47,128 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 3 states. [2021-01-07 05:34:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:47,139 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-01-07 05:34:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:47,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-07 05:34:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:47,143 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:34:47,144 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:34:47,145 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:34:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:34:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2021-01-07 05:34:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:34:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2021-01-07 05:34:47,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2021-01-07 05:34:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:47,153 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2021-01-07 05:34:47,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2021-01-07 05:34:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-07 05:34:47,157 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:47,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:47,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:34:47,157 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 671668623, now seen corresponding path program 1 times [2021-01-07 05:34:47,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:47,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450023744] [2021-01-07 05:34:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,261 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:34:47,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450023744] [2021-01-07 05:34:47,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:47,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:34:47,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731565046] [2021-01-07 05:34:47,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:47,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:34:47,264 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 3 states. [2021-01-07 05:34:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:47,280 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-01-07 05:34:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:47,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-07 05:34:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:47,281 INFO L225 Difference]: With dead ends: 88 [2021-01-07 05:34:47,282 INFO L226 Difference]: Without dead ends: 88 [2021-01-07 05:34:47,282 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:34:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-07 05:34:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-01-07 05:34:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:34:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2021-01-07 05:34:47,287 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 9 [2021-01-07 05:34:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:47,288 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2021-01-07 05:34:47,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2021-01-07 05:34:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 05:34:47,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:47,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:47,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:34:47,290 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:47,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:47,290 INFO L82 PathProgramCache]: Analyzing trace with hash -298497665, now seen corresponding path program 1 times [2021-01-07 05:34:47,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:47,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356619504] [2021-01-07 05:34:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,349 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:34:47,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356619504] [2021-01-07 05:34:47,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901575688] [2021-01-07 05:34:47,350 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:34:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:34:47,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:47,505 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:34:47,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:47,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 05:34:47,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946368602] [2021-01-07 05:34:47,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:47,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:47,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:47,508 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 5 states. [2021-01-07 05:34:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:47,525 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-01-07 05:34:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:34:47,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-07 05:34:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:47,526 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:34:47,526 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:34:47,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:34:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-01-07 05:34:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-01-07 05:34:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2021-01-07 05:34:47,532 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 14 [2021-01-07 05:34:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:47,532 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2021-01-07 05:34:47,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2021-01-07 05:34:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:34:47,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:47,533 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:47,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:47,748 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466659, now seen corresponding path program 1 times [2021-01-07 05:34:47,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:47,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890118179] [2021-01-07 05:34:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:47,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890118179] [2021-01-07 05:34:47,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025416901] [2021-01-07 05:34:47,886 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:34:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:47,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 05:34:47,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:47,995 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:47,996 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:47,999 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:47,999 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:48,000 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:48,033 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:48,034 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:34:48,037 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:48,049 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:34:48,051 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:34:48,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:34:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:48,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:48,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2021-01-07 05:34:48,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441754951] [2021-01-07 05:34:48,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:48,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:48,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:48,086 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 5 states. [2021-01-07 05:34:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:48,191 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-01-07 05:34:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:34:48,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:34:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:48,193 INFO L225 Difference]: With dead ends: 100 [2021-01-07 05:34:48,193 INFO L226 Difference]: Without dead ends: 100 [2021-01-07 05:34:48,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:34:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-01-07 05:34:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2021-01-07 05:34:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-01-07 05:34:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2021-01-07 05:34:48,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 16 [2021-01-07 05:34:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:48,199 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2021-01-07 05:34:48,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2021-01-07 05:34:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:34:48,200 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:48,200 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:48,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:48,417 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466660, now seen corresponding path program 1 times [2021-01-07 05:34:48,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:48,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437305762] [2021-01-07 05:34:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:48,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437305762] [2021-01-07 05:34:48,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415543946] [2021-01-07 05:34:48,547 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:34:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:48,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 05:34:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:48,669 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:48,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:48,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:48,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:48,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:34:48,742 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:48,743 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:34:48,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:48,763 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2021-01-07 05:34:48,767 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:34:48,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2021-01-07 05:34:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:48,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:48,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 4 [2021-01-07 05:34:48,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122245782] [2021-01-07 05:34:48,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:48,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:48,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:48,795 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2021-01-07 05:34:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:48,903 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-01-07 05:34:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:34:48,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-07 05:34:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:48,904 INFO L225 Difference]: With dead ends: 87 [2021-01-07 05:34:48,905 INFO L226 Difference]: Without dead ends: 87 [2021-01-07 05:34:48,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:34:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-07 05:34:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-01-07 05:34:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:34:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2021-01-07 05:34:48,910 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 16 [2021-01-07 05:34:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:48,910 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2021-01-07 05:34:48,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2021-01-07 05:34:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:34:48,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:48,911 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:49,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:49,125 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1895030251, now seen corresponding path program 2 times [2021-01-07 05:34:49,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:49,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113169243] [2021-01-07 05:34:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:49,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113169243] [2021-01-07 05:34:49,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471689344] [2021-01-07 05:34:49,182 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 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:34:49,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 05:34:49,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 05:34:49,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 05:34:49,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:49,298 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:49,298 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:49,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:49,301 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:49,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:49,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:34:49,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-07 05:34:49,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788122574] [2021-01-07 05:34:49,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:49,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:49,311 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 3 states. [2021-01-07 05:34:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:49,386 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2021-01-07 05:34:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:49,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-07 05:34:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:49,388 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:34:49,389 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:34:49,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:34:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2021-01-07 05:34:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:34:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2021-01-07 05:34:49,407 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2021-01-07 05:34:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:49,411 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2021-01-07 05:34:49,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2021-01-07 05:34:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:34:49,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:49,412 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:49,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:49,627 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1895030252, now seen corresponding path program 1 times [2021-01-07 05:34:49,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:49,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890536616] [2021-01-07 05:34:49,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:49,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890536616] [2021-01-07 05:34:49,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475144049] [2021-01-07 05:34:49,678 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:34:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:49,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 05:34:49,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:34:49,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:49,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-07 05:34:49,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78632616] [2021-01-07 05:34:49,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:34:49,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:34:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:34:49,806 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2021-01-07 05:34:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:49,839 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-01-07 05:34:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:34:49,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2021-01-07 05:34:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:49,841 INFO L225 Difference]: With dead ends: 84 [2021-01-07 05:34:49,841 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 05:34:49,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:34:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 05:34:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-01-07 05:34:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:34:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-01-07 05:34:49,844 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 21 [2021-01-07 05:34:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:49,845 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-01-07 05:34:49,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:34:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-01-07 05:34:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:34:49,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:49,846 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:34:50,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:50,060 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1765778068, now seen corresponding path program 1 times [2021-01-07 05:34:50,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:50,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307764660] [2021-01-07 05:34:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:50,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307764660] [2021-01-07 05:34:50,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:50,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:34:50,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794460198] [2021-01-07 05:34:50,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:34:50,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:34:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:34:50,111 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 3 states. [2021-01-07 05:34:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:50,172 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-01-07 05:34:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:34:50,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-01-07 05:34:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:50,174 INFO L225 Difference]: With dead ends: 81 [2021-01-07 05:34:50,174 INFO L226 Difference]: Without dead ends: 81 [2021-01-07 05:34:50,174 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:34:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-07 05:34:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-01-07 05:34:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:34:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2021-01-07 05:34:50,177 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 22 [2021-01-07 05:34:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:50,178 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2021-01-07 05:34:50,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:34:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2021-01-07 05:34:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:34:50,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:50,179 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] [2021-01-07 05:34:50,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:34:50,179 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 199703601, now seen corresponding path program 1 times [2021-01-07 05:34:50,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:50,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050142592] [2021-01-07 05:34:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:50,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050142592] [2021-01-07 05:34:50,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134689458] [2021-01-07 05:34:50,278 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:34:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:50,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 05:34:50,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:50,387 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:50,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:50,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:50,390 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:50,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:34:50,408 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:50,409 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:34:50,411 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:50,424 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:34:50,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:50,425 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2021-01-07 05:34:50,470 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:50,470 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:34:50,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:50,486 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:34:50,488 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:34:50,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:34:50,530 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:50,531 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:34:50,534 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:50,551 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2021-01-07 05:34:50,553 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:34:50,553 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2021-01-07 05:34:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:34:50,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:34:50,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-01-07 05:34:50,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819140008] [2021-01-07 05:34:50,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:34:50,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:50,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:34:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:50,582 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 7 states. [2021-01-07 05:34:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:50,735 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-01-07 05:34:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:34:50,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2021-01-07 05:34:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:50,737 INFO L225 Difference]: With dead ends: 87 [2021-01-07 05:34:50,737 INFO L226 Difference]: Without dead ends: 87 [2021-01-07 05:34:50,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:34:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-07 05:34:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2021-01-07 05:34:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-01-07 05:34:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2021-01-07 05:34:50,741 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 27 [2021-01-07 05:34:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:50,741 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-01-07 05:34:50,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:34:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2021-01-07 05:34:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:34:50,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:50,742 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] [2021-01-07 05:34:50,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:50,956 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 199703602, now seen corresponding path program 1 times [2021-01-07 05:34:50,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:50,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662680850] [2021-01-07 05:34:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 05:34:51,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662680850] [2021-01-07 05:34:51,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811147200] [2021-01-07 05:34:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:51,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 05:34:51,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:51,218 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:51,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:51,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:51,233 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:51,233 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 05:34:51,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:51,254 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:34:51,256 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:51,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:51,269 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:34:51,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2021-01-07 05:34:51,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:51,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:51,363 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:51,364 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:34:51,369 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:51,409 INFO L625 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2021-01-07 05:34:51,414 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:34:51,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:30 [2021-01-07 05:34:51,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:51,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:51,524 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:51,525 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:34:51,529 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:51,559 INFO L625 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2021-01-07 05:34:51,566 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:34:51,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2021-01-07 05:34:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 05:34:51,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:34:51,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-01-07 05:34:51,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743700307] [2021-01-07 05:34:51,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:51,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:51,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:51,663 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 5 states. [2021-01-07 05:34:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:51,808 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-01-07 05:34:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:34:51,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-01-07 05:34:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:51,810 INFO L225 Difference]: With dead ends: 69 [2021-01-07 05:34:51,810 INFO L226 Difference]: Without dead ends: 69 [2021-01-07 05:34:51,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:34:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-01-07 05:34:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-01-07 05:34:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-07 05:34:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-01-07 05:34:51,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 27 [2021-01-07 05:34:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:51,815 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-01-07 05:34:51,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-01-07 05:34:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:34:51,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:51,816 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] [2021-01-07 05:34:52,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:52,030 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1895844371, now seen corresponding path program 1 times [2021-01-07 05:34:52,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:52,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414256810] [2021-01-07 05:34:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:52,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414256810] [2021-01-07 05:34:52,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:52,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:34:52,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880650018] [2021-01-07 05:34:52,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:52,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:52,117 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2021-01-07 05:34:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:52,214 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2021-01-07 05:34:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:34:52,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-07 05:34:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:52,216 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:34:52,216 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:34:52,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:34:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2021-01-07 05:34:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-07 05:34:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-01-07 05:34:52,219 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 28 [2021-01-07 05:34:52,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:52,220 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-01-07 05:34:52,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-01-07 05:34:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:34:52,221 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:52,221 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] [2021-01-07 05:34:52,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:34:52,221 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1895844372, now seen corresponding path program 1 times [2021-01-07 05:34:52,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:52,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137017665] [2021-01-07 05:34:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:52,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137017665] [2021-01-07 05:34:52,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:52,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:34:52,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042136658] [2021-01-07 05:34:52,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:34:52,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:34:52,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:34:52,292 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2021-01-07 05:34:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:52,395 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-01-07 05:34:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:34:52,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-07 05:34:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:52,396 INFO L225 Difference]: With dead ends: 67 [2021-01-07 05:34:52,396 INFO L226 Difference]: Without dead ends: 67 [2021-01-07 05:34:52,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:34:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-07 05:34:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-01-07 05:34:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-07 05:34:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-01-07 05:34:52,399 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 28 [2021-01-07 05:34:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:52,400 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-01-07 05:34:52,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:34:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-01-07 05:34:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:34:52,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:52,401 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] [2021-01-07 05:34:52,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:34:52,401 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1740473348, now seen corresponding path program 1 times [2021-01-07 05:34:52,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:52,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081555113] [2021-01-07 05:34:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:52,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081555113] [2021-01-07 05:34:52,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:52,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:34:52,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250364465] [2021-01-07 05:34:52,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:34:52,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:34:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:34:52,620 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 12 states. [2021-01-07 05:34:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:53,207 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2021-01-07 05:34:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:34:53,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2021-01-07 05:34:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:53,209 INFO L225 Difference]: With dead ends: 79 [2021-01-07 05:34:53,209 INFO L226 Difference]: Without dead ends: 79 [2021-01-07 05:34:53,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:34:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-01-07 05:34:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2021-01-07 05:34:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-07 05:34:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-01-07 05:34:53,213 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 33 [2021-01-07 05:34:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:53,213 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-01-07 05:34:53,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:34:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-01-07 05:34:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 05:34:53,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:53,214 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] [2021-01-07 05:34:53,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:34:53,215 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1740473347, now seen corresponding path program 1 times [2021-01-07 05:34:53,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:53,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62407182] [2021-01-07 05:34:53,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:53,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62407182] [2021-01-07 05:34:53,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:53,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:34:53,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403937739] [2021-01-07 05:34:53,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:34:53,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:34:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:34:53,495 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 12 states. [2021-01-07 05:34:54,107 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-01-07 05:34:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:54,233 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2021-01-07 05:34:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:34:54,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2021-01-07 05:34:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:54,234 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:34:54,235 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:34:54,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:34:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:34:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2021-01-07 05:34:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-07 05:34:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-01-07 05:34:54,240 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 33 [2021-01-07 05:34:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:54,240 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-01-07 05:34:54,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:34:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-01-07 05:34:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:34:54,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:54,243 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] [2021-01-07 05:34:54,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:34:54,243 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1329024838, now seen corresponding path program 1 times [2021-01-07 05:34:54,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:54,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684218689] [2021-01-07 05:34:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:54,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684218689] [2021-01-07 05:34:54,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:54,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:34:54,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088394483] [2021-01-07 05:34:54,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:34:54,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:34:54,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:34:54,390 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2021-01-07 05:34:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:54,639 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-01-07 05:34:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:34:54,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2021-01-07 05:34:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:54,641 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:34:54,641 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:34:54,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:34:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:34:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2021-01-07 05:34:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-07 05:34:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2021-01-07 05:34:54,646 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 36 [2021-01-07 05:34:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:54,647 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2021-01-07 05:34:54,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:34:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2021-01-07 05:34:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:34:54,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:54,649 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] [2021-01-07 05:34:54,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:34:54,649 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1329024837, now seen corresponding path program 1 times [2021-01-07 05:34:54,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:54,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218050706] [2021-01-07 05:34:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:54,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218050706] [2021-01-07 05:34:54,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:54,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:34:54,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998559007] [2021-01-07 05:34:54,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:34:54,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:34:54,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:34:54,821 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 8 states. [2021-01-07 05:34:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:55,139 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-01-07 05:34:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:34:55,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2021-01-07 05:34:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:55,140 INFO L225 Difference]: With dead ends: 88 [2021-01-07 05:34:55,141 INFO L226 Difference]: Without dead ends: 88 [2021-01-07 05:34:55,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:34:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-01-07 05:34:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2021-01-07 05:34:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-07 05:34:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-01-07 05:34:55,144 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 36 [2021-01-07 05:34:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:55,144 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-01-07 05:34:55,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:34:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-01-07 05:34:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:34:55,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:55,145 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] [2021-01-07 05:34:55,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:34:55,145 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:55,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1749901707, now seen corresponding path program 1 times [2021-01-07 05:34:55,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:55,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439258304] [2021-01-07 05:34:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 05:34:55,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439258304] [2021-01-07 05:34:55,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:55,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:34:55,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361640684] [2021-01-07 05:34:55,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:34:55,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:34:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:34:55,260 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 9 states. [2021-01-07 05:34:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:55,460 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-01-07 05:34:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:34:55,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2021-01-07 05:34:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:55,462 INFO L225 Difference]: With dead ends: 71 [2021-01-07 05:34:55,462 INFO L226 Difference]: Without dead ends: 71 [2021-01-07 05:34:55,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:34:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-07 05:34:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2021-01-07 05:34:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-07 05:34:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-01-07 05:34:55,464 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2021-01-07 05:34:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:55,465 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-01-07 05:34:55,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:34:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-01-07 05:34:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 05:34:55,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:55,465 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] [2021-01-07 05:34:55,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:34:55,466 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash -950961311, now seen corresponding path program 1 times [2021-01-07 05:34:55,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:55,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930291772] [2021-01-07 05:34:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:55,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930291772] [2021-01-07 05:34:55,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:55,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:34:55,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862953738] [2021-01-07 05:34:55,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:34:55,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:34:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:34:55,656 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2021-01-07 05:34:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:56,102 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-01-07 05:34:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:34:56,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2021-01-07 05:34:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:56,103 INFO L225 Difference]: With dead ends: 68 [2021-01-07 05:34:56,103 INFO L226 Difference]: Without dead ends: 68 [2021-01-07 05:34:56,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:34:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-01-07 05:34:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-01-07 05:34:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-07 05:34:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-01-07 05:34:56,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2021-01-07 05:34:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:56,106 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-01-07 05:34:56,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:34:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-01-07 05:34:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 05:34:56,107 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:56,107 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] [2021-01-07 05:34:56,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:34:56,108 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 186410219, now seen corresponding path program 1 times [2021-01-07 05:34:56,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:56,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903497220] [2021-01-07 05:34:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:34:56,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903497220] [2021-01-07 05:34:56,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:34:56,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-07 05:34:56,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217876062] [2021-01-07 05:34:56,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:34:56,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:34:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:34:56,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:34:56,469 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 16 states. [2021-01-07 05:34:57,090 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-01-07 05:34:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:34:57,702 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-01-07 05:34:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:34:57,703 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2021-01-07 05:34:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:34:57,703 INFO L225 Difference]: With dead ends: 81 [2021-01-07 05:34:57,704 INFO L226 Difference]: Without dead ends: 81 [2021-01-07 05:34:57,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:34:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-07 05:34:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2021-01-07 05:34:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-07 05:34:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2021-01-07 05:34:57,707 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 43 [2021-01-07 05:34:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:34:57,708 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2021-01-07 05:34:57,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:34:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2021-01-07 05:34:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:34:57,708 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:34:57,708 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-07 05:34:57,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:34:57,709 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.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:34:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:34:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1483750000, now seen corresponding path program 1 times [2021-01-07 05:34:57,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:34:57,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340882328] [2021-01-07 05:34:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:34:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:34:58,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340882328] [2021-01-07 05:34:58,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772249738] [2021-01-07 05:34:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:34:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:34:58,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 56 conjunts are in the unsatisfiable core [2021-01-07 05:34:58,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:34:58,480 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:58,481 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:58,487 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,487 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 05:34:58,663 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:58,663 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 21 treesize of output 59 [2021-01-07 05:34:58,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:58,671 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:58,686 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,686 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-01-07 05:34:58,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:58,775 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 31 treesize of output 26 [2021-01-07 05:34:58,777 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:58,796 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2021-01-07 05:34:58,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:58,883 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-07 05:34:58,884 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 40 treesize of output 38 [2021-01-07 05:34:58,887 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:58,909 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:34:58,909 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2021-01-07 05:34:59,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:59,028 INFO L348 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2021-01-07 05:34:59,028 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2021-01-07 05:34:59,038 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:59,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:34:59,060 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:59,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:55 [2021-01-07 05:34:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:34:59,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:34:59,674 INFO L348 Elim1Store]: treesize reduction 12, result has 85.5 percent of original size [2021-01-07 05:34:59,674 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 102 [2021-01-07 05:34:59,679 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:34:59,778 INFO L625 ElimStorePlain]: treesize reduction 42, result has 66.9 percent of original size [2021-01-07 05:34:59,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:59,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:59,784 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:59,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:85 [2021-01-07 05:34:59,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:59,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:59,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:34:59,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:00,491 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-01-07 05:35:00,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 11, 1] term [2021-01-07 05:35:00,509 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:00,524 INFO L443 ElimStorePlain]: Different costs {20=[v_prenex_4, v_prenex_2], 30=[|v_#memory_$Pointer$.base_33|]} [2021-01-07 05:35:00,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:00,606 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,607 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 149 [2021-01-07 05:35:00,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:35:00,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:00,616 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:00,907 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2021-01-07 05:35:00,908 INFO L625 ElimStorePlain]: treesize reduction 24, result has 92.1 percent of original size [2021-01-07 05:35:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:00,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:00,991 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:00,991 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 149 [2021-01-07 05:35:00,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2021-01-07 05:35:00,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:00,999 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,351 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-01-07 05:35:01,352 INFO L625 ElimStorePlain]: treesize reduction 24, result has 92.4 percent of original size [2021-01-07 05:35:01,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:01,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:01,570 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-01-07 05:35:01,574 INFO L348 Elim1Store]: treesize reduction 12, result has 94.0 percent of original size [2021-01-07 05:35:01,575 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 219 [2021-01-07 05:35:01,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 3, 2, 1] term [2021-01-07 05:35:01,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 05:35:01,589 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:01,907 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-01-07 05:35:01,908 INFO L625 ElimStorePlain]: treesize reduction 54, result has 84.8 percent of original size [2021-01-07 05:35:01,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:01,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:01,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:01,916 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2021-01-07 05:35:01,916 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:271, output treesize:301 [2021-01-07 05:35:01,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:01,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:01,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,209 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-07 05:35:02,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,415 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:02,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:02,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:02,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:02,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:02,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,488 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:35:02,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:02,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2021-01-07 05:35:02,511 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:35:02,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:02,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:35:02,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:02,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:35:02,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:35:02,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:02,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:02,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:02,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:02,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:35:02,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:35:02,743 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_14, |v_#memory_$Pointer$.offset_29|, v_prenex_9], 30=[v_prenex_12, v_prenex_8], 42=[|v_#memory_$Pointer$.base_34|]} [2021-01-07 05:35:02,767 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:35:02,768 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:02,799 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:35:02,800 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,840 WARN L197 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 137 DAG size of output: 137 [2021-01-07 05:35:03,841 INFO L625 ElimStorePlain]: treesize reduction 30, result has 94.9 percent of original size [2021-01-07 05:35:03,870 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:35:03,870 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:03,890 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:35:03,890 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,306 WARN L197 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-01-07 05:35:04,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,328 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:35:04,331 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,346 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:35:04,347 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,757 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2021-01-07 05:35:04,758 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:04,846 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,846 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 3 case distinctions, treesize of input 54 treesize of output 94 [2021-01-07 05:35:04,854 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:04,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:04,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:04,924 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:04,925 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 132 [2021-01-07 05:35:04,931 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:05,687 WARN L197 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 129 [2021-01-07 05:35:05,688 INFO L625 ElimStorePlain]: treesize reduction 86, result has 85.5 percent of original size [2021-01-07 05:35:05,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:05,764 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:05,765 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 3 case distinctions, treesize of input 54 treesize of output 94 [2021-01-07 05:35:05,768 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:05,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:05,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:05,843 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:05,844 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 132 [2021-01-07 05:35:05,853 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:06,482 WARN L197 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 124 [2021-01-07 05:35:06,483 INFO L625 ElimStorePlain]: treesize reduction 92, result has 83.9 percent of original size [2021-01-07 05:35:06,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:06,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:06,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:06,607 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:06,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 184 [2021-01-07 05:35:06,614 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:06,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:06,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:35:06,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:06,721 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:06,721 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 144 [2021-01-07 05:35:06,725 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:07,339 WARN L197 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2021-01-07 05:35:07,340 INFO L625 ElimStorePlain]: treesize reduction 154, result has 74.0 percent of original size [2021-01-07 05:35:07,363 INFO L547 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2021-01-07 05:35:07,363 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 19 variables, input treesize:601, output treesize:570 [2021-01-07 05:35:20,238 WARN L197 SmtUtils]: Spent 12.61 s on a formula simplification. DAG size of input: 163 DAG size of output: 119 [2021-01-07 05:35:20,252 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:35:20,270 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-07 05:35:20,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,332 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2021-01-07 05:35:20,333 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:20,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2021-01-07 05:35:20,348 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:20,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2021-01-07 05:35:20,363 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:20,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:20,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2021-01-07 05:35:20,376 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:20,527 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-07 05:35:20,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:20,549 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 4 xjuncts. [2021-01-07 05:35:20,549 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:483, output treesize:389 [2021-01-07 05:35:22,870 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 119 [2021-01-07 05:35:25,181 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 119 [2021-01-07 05:35:25,239 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:35:25,289 INFO L443 ElimStorePlain]: Different costs {12=[v_prenex_29, |#memory_$Pointer$.base|], 20=[v_prenex_25], 30=[v_prenex_27]} [2021-01-07 05:35:25,389 INFO L348 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2021-01-07 05:35:25,390 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 109 [2021-01-07 05:35:25,394 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:25,395 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:25,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:25,398 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:35:25,402 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:35:25,516 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-01-07 05:35:25,516 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:25,594 INFO L348 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2021-01-07 05:35:25,595 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 76 [2021-01-07 05:35:25,598 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:35:25,698 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-01-07 05:35:25,699 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:25,861 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-01-07 05:35:25,862 INFO L348 Elim1Store]: treesize reduction 12, result has 91.5 percent of original size [2021-01-07 05:35:25,862 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 166 [2021-01-07 05:35:25,867 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:25,868 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:25,870 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:25,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:25,872 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,874 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:25,877 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,879 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,882 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:25,883 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:25,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:25,885 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,887 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:35:25,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:35:25,890 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:35:25,892 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:25,896 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:26,000 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-01-07 05:35:26,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:26,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:35:26,285 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2021-01-07 05:35:26,286 INFO L348 Elim1Store]: treesize reduction 28, result has 86.0 percent of original size [2021-01-07 05:35:26,287 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 209 [2021-01-07 05:35:26,292 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:26,293 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:26,294 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:35:26,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:35:26,295 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,296 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:35:26,297 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,299 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:26,300 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:26,302 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:26,303 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,305 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:26,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:26,307 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:26,307 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,310 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:35:26,311 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:35:26,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:35:26,313 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:35:26,314 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:35:26,317 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:35:26,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:35:26,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:26,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:35:26,425 INFO L547 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-01-07 05:35:26,426 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:413, output treesize:62 [2021-01-07 05:35:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:35:26,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:35:26,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2021-01-07 05:35:26,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460846626] [2021-01-07 05:35:26,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-01-07 05:35:26,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:35:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-01-07 05:35:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=0, NotChecked=0, Total=1640 [2021-01-07 05:35:26,837 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 41 states. [2021-01-07 05:35:28,255 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2021-01-07 05:35:29,019 WARN L197 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-01-07 05:35:29,361 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2021-01-07 05:35:29,724 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2021-01-07 05:35:30,099 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2021-01-07 05:35:30,408 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2021-01-07 05:35:37,152 WARN L197 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2021-01-07 05:35:37,681 WARN L197 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2021-01-07 05:35:38,123 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2021-01-07 05:36:42,839 WARN L197 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2021-01-07 05:37:41,731 WARN L197 SmtUtils]: Spent 56.73 s on a formula simplification. DAG size of input: 248 DAG size of output: 220 [2021-01-07 05:38:46,707 WARN L197 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 243 DAG size of output: 237