/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/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:28:37,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:28:37,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:28:38,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:28:38,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:28:38,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:28:38,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:28:38,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:28:38,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:28:38,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:28:38,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:28:38,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:28:38,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:28:38,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:28:38,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:28:38,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:28:38,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:28:38,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:28:38,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:28:38,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:28:38,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:28:38,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:28:38,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:28:38,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:28:38,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:28:38,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:28:38,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:28:38,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:28:38,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:28:38,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:28:38,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:28:38,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:28:38,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:28:38,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:28:38,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:28:38,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:28:38,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:28:38,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:28:38,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:28:38,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:28:38,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:28:38,108 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:28:38,159 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:28:38,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:28:38,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:28:38,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:28:38,164 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:28:38,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:28:38,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:28:38,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:28:38,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:28:38,165 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:28:38,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:28:38,167 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:28:38,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:28:38,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:28:38,168 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:28:38,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:28:38,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:28:38,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:28:38,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:28:38,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:28:38,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:28:38,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:28:38,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:28:38,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:28:38,170 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:28:38,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:28:38,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:28:38,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:28:38,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:28:38,617 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:28:38,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-01-07 05:28:38,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7dc8f8922/0b55021e161543ba8892af8af50e0569/FLAG995fd75b3 [2021-01-07 05:28:39,424 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:28:39,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2021-01-07 05:28:39,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7dc8f8922/0b55021e161543ba8892af8af50e0569/FLAG995fd75b3 [2021-01-07 05:28:39,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7dc8f8922/0b55021e161543ba8892af8af50e0569 [2021-01-07 05:28:39,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:28:39,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:28:39,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:28:39,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:28:39,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:28:39,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:28:39" (1/1) ... [2021-01-07 05:28:39,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f2dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:39, skipping insertion in model container [2021-01-07 05:28:39,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:28:39" (1/1) ... [2021-01-07 05:28:39,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:28:39,801 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2021-01-07 05:28:40,188 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/forester-heap/sll-circular-1.i[22324,22337] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:28:40,194 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/forester-heap/sll-circular-1.i[22430,22443] [2021-01-07 05:28:40,196 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/forester-heap/sll-circular-1.i[22555,22568] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:28:40,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:28:40,213 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],StructAccessExpression[IdentifierExpression[~head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],StructAccessExpression[IdentifierExpression[~x~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] [2021-01-07 05:28:40,266 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/forester-heap/sll-circular-1.i[22324,22337] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:28:40,268 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/forester-heap/sll-circular-1.i[22430,22443] [2021-01-07 05:28:40,270 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/forester-heap/sll-circular-1.i[22555,22568] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:28:40,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:28:40,333 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:28:40,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40 WrapperNode [2021-01-07 05:28:40,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:28:40,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:28:40,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:28:40,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:28:40,345 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:28:40" (1/1) ... [2021-01-07 05:28:40,363 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:28:40" (1/1) ... [2021-01-07 05:28:40,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:28:40,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:28:40,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:28:40,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:28:40,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (1/1) ... [2021-01-07 05:28:40,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:28:40,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:28:40,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:28:40,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:28:40,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (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:28:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 05:28:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 05:28:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:28:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:28:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:28:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:28:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:28:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:28:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:28:40,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:28:41,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:28:41,249 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-01-07 05:28:41,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:28:41 BoogieIcfgContainer [2021-01-07 05:28:41,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:28:41,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:28:41,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:28:41,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:28:41,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:28:39" (1/3) ... [2021-01-07 05:28:41,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2673345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:28:41, skipping insertion in model container [2021-01-07 05:28:41,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:28:40" (2/3) ... [2021-01-07 05:28:41,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2673345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:28:41, skipping insertion in model container [2021-01-07 05:28:41,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:28:41" (3/3) ... [2021-01-07 05:28:41,261 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2021-01-07 05:28:41,268 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:28:41,275 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2021-01-07 05:28:41,296 INFO L253 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-01-07 05:28:41,321 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:28:41,321 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:28:41,321 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:28:41,321 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:28:41,322 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:28:41,322 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:28:41,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:28:41,322 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:28:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2021-01-07 05:28:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:28:41,359 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:41,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:28:41,361 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-01-07 05:28:41,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:41,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838081596] [2021-01-07 05:28:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:41,680 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:28:41,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838081596] [2021-01-07 05:28:41,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:41,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:28:41,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821791213] [2021-01-07 05:28:41,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:28:41,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:28:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:28:41,716 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2021-01-07 05:28:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:41,863 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-01-07 05:28:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:28:41,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:28:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:41,877 INFO L225 Difference]: With dead ends: 107 [2021-01-07 05:28:41,877 INFO L226 Difference]: Without dead ends: 105 [2021-01-07 05:28:41,879 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:28:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-01-07 05:28:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2021-01-07 05:28:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-07 05:28:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-01-07 05:28:41,927 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 3 [2021-01-07 05:28:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:41,927 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-01-07 05:28:41,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:28:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-01-07 05:28:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:28:41,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:41,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:28:41,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:28:41,930 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-01-07 05:28:41,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:41,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427605836] [2021-01-07 05:28:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:42,016 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:28:42,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427605836] [2021-01-07 05:28:42,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:42,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:28:42,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875511421] [2021-01-07 05:28:42,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:28:42,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:28:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:28:42,027 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 3 states. [2021-01-07 05:28:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:42,162 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2021-01-07 05:28:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:28:42,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:28:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:42,165 INFO L225 Difference]: With dead ends: 103 [2021-01-07 05:28:42,165 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 05:28:42,166 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:28:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 05:28:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2021-01-07 05:28:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-07 05:28:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-01-07 05:28:42,177 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 3 [2021-01-07 05:28:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:42,178 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-01-07 05:28:42,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:28:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-01-07 05:28:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:28:42,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:42,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:42,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:28:42,180 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash 59263651, now seen corresponding path program 1 times [2021-01-07 05:28:42,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:42,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050120113] [2021-01-07 05:28:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:42,241 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:28:42,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050120113] [2021-01-07 05:28:42,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:42,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:28:42,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685278284] [2021-01-07 05:28:42,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:28:42,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:28:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:28:42,246 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 4 states. [2021-01-07 05:28:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:42,457 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-01-07 05:28:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:28:42,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:28:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:42,460 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:28:42,460 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:28:42,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:28:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:28:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2021-01-07 05:28:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-07 05:28:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-01-07 05:28:42,469 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 8 [2021-01-07 05:28:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:42,470 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-01-07 05:28:42,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:28:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-01-07 05:28:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:28:42,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:42,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:42,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:28:42,472 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2021-01-07 05:28:42,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:42,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62727893] [2021-01-07 05:28:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:42,546 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:28:42,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62727893] [2021-01-07 05:28:42,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:42,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:28:42,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402230512] [2021-01-07 05:28:42,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:28:42,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:28:42,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:28:42,549 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 4 states. [2021-01-07 05:28:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:42,732 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-01-07 05:28:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:28:42,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-01-07 05:28:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:42,734 INFO L225 Difference]: With dead ends: 99 [2021-01-07 05:28:42,735 INFO L226 Difference]: Without dead ends: 99 [2021-01-07 05:28:42,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:28:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-07 05:28:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2021-01-07 05:28:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:28:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-01-07 05:28:42,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 8 [2021-01-07 05:28:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:42,744 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-01-07 05:28:42,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:28:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-01-07 05:28:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:28:42,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:42,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:42,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:28:42,746 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 292159341, now seen corresponding path program 1 times [2021-01-07 05:28:42,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:42,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327198801] [2021-01-07 05:28:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:42,820 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:28:42,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327198801] [2021-01-07 05:28:42,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:42,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:28:42,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756698577] [2021-01-07 05:28:42,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:28:42,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:28:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:28:42,823 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 6 states. [2021-01-07 05:28:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:43,139 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2021-01-07 05:28:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:28:43,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-07 05:28:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:43,141 INFO L225 Difference]: With dead ends: 135 [2021-01-07 05:28:43,141 INFO L226 Difference]: Without dead ends: 135 [2021-01-07 05:28:43,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:28:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-07 05:28:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 84. [2021-01-07 05:28:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:28:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-01-07 05:28:43,174 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 11 [2021-01-07 05:28:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:43,174 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-01-07 05:28:43,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:28:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-01-07 05:28:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:28:43,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:43,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:43,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:28:43,179 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash 292159342, now seen corresponding path program 1 times [2021-01-07 05:28:43,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:43,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331066867] [2021-01-07 05:28:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:43,306 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:28:43,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331066867] [2021-01-07 05:28:43,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:43,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:28:43,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002965184] [2021-01-07 05:28:43,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:28:43,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:43,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:28:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:28:43,310 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2021-01-07 05:28:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:43,696 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-01-07 05:28:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:28:43,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-07 05:28:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:43,698 INFO L225 Difference]: With dead ends: 133 [2021-01-07 05:28:43,698 INFO L226 Difference]: Without dead ends: 133 [2021-01-07 05:28:43,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:28:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-01-07 05:28:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 74. [2021-01-07 05:28:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:28:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-01-07 05:28:43,704 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 11 [2021-01-07 05:28:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:43,705 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-01-07 05:28:43,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:28:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-01-07 05:28:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-07 05:28:43,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:43,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:43,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:28:43,706 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash 459370694, now seen corresponding path program 1 times [2021-01-07 05:28:43,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:43,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905387819] [2021-01-07 05:28:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:43,850 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:28:43,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905387819] [2021-01-07 05:28:43,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:43,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:28:43,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114518068] [2021-01-07 05:28:43,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:43,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:43,854 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 8 states. [2021-01-07 05:28:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:44,167 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-01-07 05:28:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:28:44,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2021-01-07 05:28:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:44,169 INFO L225 Difference]: With dead ends: 162 [2021-01-07 05:28:44,170 INFO L226 Difference]: Without dead ends: 162 [2021-01-07 05:28:44,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-07 05:28:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 80. [2021-01-07 05:28:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-07 05:28:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2021-01-07 05:28:44,176 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 12 [2021-01-07 05:28:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:44,176 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2021-01-07 05:28:44,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2021-01-07 05:28:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:28:44,177 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:44,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:44,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:28:44,178 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1355593788, now seen corresponding path program 1 times [2021-01-07 05:28:44,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:44,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033561904] [2021-01-07 05:28:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:44,355 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:28:44,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033561904] [2021-01-07 05:28:44,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:44,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:44,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015567213] [2021-01-07 05:28:44,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:44,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:44,359 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 8 states. [2021-01-07 05:28:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:44,753 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2021-01-07 05:28:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:28:44,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2021-01-07 05:28:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:44,754 INFO L225 Difference]: With dead ends: 123 [2021-01-07 05:28:44,754 INFO L226 Difference]: Without dead ends: 123 [2021-01-07 05:28:44,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-07 05:28:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2021-01-07 05:28:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:28:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2021-01-07 05:28:44,760 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 13 [2021-01-07 05:28:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:44,760 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2021-01-07 05:28:44,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2021-01-07 05:28:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 05:28:44,761 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:44,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:44,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:28:44,762 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1355593789, now seen corresponding path program 1 times [2021-01-07 05:28:44,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:44,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789740810] [2021-01-07 05:28:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:44,953 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:28:44,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789740810] [2021-01-07 05:28:44,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:44,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:44,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570118163] [2021-01-07 05:28:44,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:44,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:44,956 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 8 states. [2021-01-07 05:28:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:45,409 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2021-01-07 05:28:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:28:45,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2021-01-07 05:28:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:45,411 INFO L225 Difference]: With dead ends: 156 [2021-01-07 05:28:45,412 INFO L226 Difference]: Without dead ends: 156 [2021-01-07 05:28:45,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-01-07 05:28:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 94. [2021-01-07 05:28:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:28:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2021-01-07 05:28:45,417 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 13 [2021-01-07 05:28:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:45,418 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2021-01-07 05:28:45,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2021-01-07 05:28:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:28:45,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:45,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:45,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:28:45,420 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1082869388, now seen corresponding path program 1 times [2021-01-07 05:28:45,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:45,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866807663] [2021-01-07 05:28:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:45,555 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:28:45,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866807663] [2021-01-07 05:28:45,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:45,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:28:45,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108352628] [2021-01-07 05:28:45,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:28:45,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:28:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:28:45,558 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 9 states. [2021-01-07 05:28:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:46,061 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-01-07 05:28:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:28:46,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2021-01-07 05:28:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:46,063 INFO L225 Difference]: With dead ends: 142 [2021-01-07 05:28:46,063 INFO L226 Difference]: Without dead ends: 142 [2021-01-07 05:28:46,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:28:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-07 05:28:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 94. [2021-01-07 05:28:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:28:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2021-01-07 05:28:46,068 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 16 [2021-01-07 05:28:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:46,069 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2021-01-07 05:28:46,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:28:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2021-01-07 05:28:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:28:46,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:46,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:46,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:28:46,070 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1082869387, now seen corresponding path program 1 times [2021-01-07 05:28:46,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:46,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818030850] [2021-01-07 05:28:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:46,233 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:28:46,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818030850] [2021-01-07 05:28:46,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:46,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:46,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509196858] [2021-01-07 05:28:46,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:46,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:46,237 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 8 states. [2021-01-07 05:28:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:46,645 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2021-01-07 05:28:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:28:46,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2021-01-07 05:28:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:46,649 INFO L225 Difference]: With dead ends: 152 [2021-01-07 05:28:46,649 INFO L226 Difference]: Without dead ends: 152 [2021-01-07 05:28:46,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-01-07 05:28:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 94. [2021-01-07 05:28:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-07 05:28:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2021-01-07 05:28:46,653 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 16 [2021-01-07 05:28:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:46,653 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2021-01-07 05:28:46,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2021-01-07 05:28:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:28:46,656 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:46,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:46,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:28:46,657 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:46,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1174743413, now seen corresponding path program 1 times [2021-01-07 05:28:46,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:46,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102171820] [2021-01-07 05:28:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:46,760 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:28:46,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102171820] [2021-01-07 05:28:46,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:46,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:28:46,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816397989] [2021-01-07 05:28:46,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:28:46,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:28:46,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:28:46,762 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 6 states. [2021-01-07 05:28:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:46,985 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2021-01-07 05:28:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:28:46,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-01-07 05:28:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:46,987 INFO L225 Difference]: With dead ends: 142 [2021-01-07 05:28:46,987 INFO L226 Difference]: Without dead ends: 142 [2021-01-07 05:28:46,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:28:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-01-07 05:28:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 92. [2021-01-07 05:28:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-01-07 05:28:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2021-01-07 05:28:46,992 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 16 [2021-01-07 05:28:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:46,992 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2021-01-07 05:28:46,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:28:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2021-01-07 05:28:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:28:46,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:46,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:46,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:28:46,994 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:46,995 INFO L82 PathProgramCache]: Analyzing trace with hash 790772532, now seen corresponding path program 1 times [2021-01-07 05:28:46,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:46,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218623034] [2021-01-07 05:28:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:47,102 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:28:47,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218623034] [2021-01-07 05:28:47,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:47,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:47,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523366575] [2021-01-07 05:28:47,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:47,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:47,105 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 8 states. [2021-01-07 05:28:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:47,440 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2021-01-07 05:28:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:28:47,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2021-01-07 05:28:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:47,443 INFO L225 Difference]: With dead ends: 131 [2021-01-07 05:28:47,443 INFO L226 Difference]: Without dead ends: 131 [2021-01-07 05:28:47,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-01-07 05:28:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2021-01-07 05:28:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-07 05:28:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2021-01-07 05:28:47,447 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 17 [2021-01-07 05:28:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:47,448 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2021-01-07 05:28:47,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2021-01-07 05:28:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:28:47,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:47,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:47,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:28:47,449 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash 790772533, now seen corresponding path program 1 times [2021-01-07 05:28:47,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:47,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180925114] [2021-01-07 05:28:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:47,578 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:28:47,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180925114] [2021-01-07 05:28:47,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:47,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:47,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084441441] [2021-01-07 05:28:47,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:47,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:47,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:47,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:47,581 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 8 states. [2021-01-07 05:28:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:47,961 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2021-01-07 05:28:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:28:47,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2021-01-07 05:28:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:47,963 INFO L225 Difference]: With dead ends: 148 [2021-01-07 05:28:47,964 INFO L226 Difference]: Without dead ends: 148 [2021-01-07 05:28:47,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-07 05:28:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2021-01-07 05:28:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-07 05:28:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-01-07 05:28:47,968 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 17 [2021-01-07 05:28:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:47,969 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-01-07 05:28:47,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-01-07 05:28:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:28:47,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:47,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:47,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 05:28:47,970 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash 9020823, now seen corresponding path program 1 times [2021-01-07 05:28:47,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:47,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805209870] [2021-01-07 05:28:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:48,087 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:28:48,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805209870] [2021-01-07 05:28:48,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:48,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:28:48,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148083015] [2021-01-07 05:28:48,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:28:48,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:48,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:28:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:28:48,090 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 8 states. [2021-01-07 05:28:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:48,390 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2021-01-07 05:28:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 05:28:48,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-01-07 05:28:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:48,392 INFO L225 Difference]: With dead ends: 144 [2021-01-07 05:28:48,392 INFO L226 Difference]: Without dead ends: 144 [2021-01-07 05:28:48,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:28:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-07 05:28:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 115. [2021-01-07 05:28:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-07 05:28:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2021-01-07 05:28:48,397 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 20 [2021-01-07 05:28:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:48,397 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2021-01-07 05:28:48,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:28:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2021-01-07 05:28:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:28:48,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:48,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:48,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 05:28:48,398 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:48,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash 452709079, now seen corresponding path program 1 times [2021-01-07 05:28:48,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:48,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989118404] [2021-01-07 05:28:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:48,440 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:28:48,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989118404] [2021-01-07 05:28:48,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:48,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:28:48,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157114750] [2021-01-07 05:28:48,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:28:48,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:28:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:28:48,445 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand 3 states. [2021-01-07 05:28:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:48,455 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2021-01-07 05:28:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:28:48,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-07 05:28:48,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:48,458 INFO L225 Difference]: With dead ends: 118 [2021-01-07 05:28:48,458 INFO L226 Difference]: Without dead ends: 118 [2021-01-07 05:28:48,459 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:28:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-07 05:28:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-01-07 05:28:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-07 05:28:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2021-01-07 05:28:48,465 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 20 [2021-01-07 05:28:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:48,466 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2021-01-07 05:28:48,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:28:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2021-01-07 05:28:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:28:48,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:48,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:48,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:28:48,467 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1760332104, now seen corresponding path program 1 times [2021-01-07 05:28:48,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:48,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656125799] [2021-01-07 05:28:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:48,505 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:28:48,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656125799] [2021-01-07 05:28:48,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:48,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:28:48,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799168995] [2021-01-07 05:28:48,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:28:48,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:48,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:28:48,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:28:48,508 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 3 states. [2021-01-07 05:28:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:48,523 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2021-01-07 05:28:48,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:28:48,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-07 05:28:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:48,527 INFO L225 Difference]: With dead ends: 185 [2021-01-07 05:28:48,527 INFO L226 Difference]: Without dead ends: 185 [2021-01-07 05:28:48,527 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:28:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-07 05:28:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2021-01-07 05:28:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-07 05:28:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2021-01-07 05:28:48,532 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 20 [2021-01-07 05:28:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:48,533 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2021-01-07 05:28:48,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:28:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2021-01-07 05:28:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:28:48,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:48,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:48,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:28:48,534 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1149126439, now seen corresponding path program 1 times [2021-01-07 05:28:48,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:48,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743589510] [2021-01-07 05:28:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:48,569 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:28:48,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743589510] [2021-01-07 05:28:48,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:48,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:28:48,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600701106] [2021-01-07 05:28:48,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:28:48,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:28:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:28:48,572 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 5 states. [2021-01-07 05:28:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:48,696 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2021-01-07 05:28:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:28:48,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2021-01-07 05:28:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:48,698 INFO L225 Difference]: With dead ends: 129 [2021-01-07 05:28:48,698 INFO L226 Difference]: Without dead ends: 129 [2021-01-07 05:28:48,698 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:28:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-01-07 05:28:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-01-07 05:28:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:28:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2021-01-07 05:28:48,703 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 21 [2021-01-07 05:28:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:48,703 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2021-01-07 05:28:48,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:28:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2021-01-07 05:28:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:28:48,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:48,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:48,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:28:48,704 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1149126440, now seen corresponding path program 1 times [2021-01-07 05:28:48,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:48,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31861620] [2021-01-07 05:28:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:48,932 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:28:48,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31861620] [2021-01-07 05:28:48,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:48,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:28:48,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885568068] [2021-01-07 05:28:48,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:28:48,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:28:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:28:48,934 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand 9 states. [2021-01-07 05:28:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:49,323 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-01-07 05:28:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:28:49,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2021-01-07 05:28:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:49,325 INFO L225 Difference]: With dead ends: 160 [2021-01-07 05:28:49,325 INFO L226 Difference]: Without dead ends: 160 [2021-01-07 05:28:49,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-01-07 05:28:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-07 05:28:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2021-01-07 05:28:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:28:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 154 transitions. [2021-01-07 05:28:49,329 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 154 transitions. Word has length 21 [2021-01-07 05:28:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:49,329 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 154 transitions. [2021-01-07 05:28:49,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:28:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2021-01-07 05:28:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:28:49,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:49,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:49,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:28:49,331 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 79083354, now seen corresponding path program 1 times [2021-01-07 05:28:49,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:49,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86522538] [2021-01-07 05:28:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:49,563 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:28:49,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86522538] [2021-01-07 05:28:49,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:49,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:28:49,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895660032] [2021-01-07 05:28:49,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:28:49,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:28:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:28:49,566 INFO L87 Difference]: Start difference. First operand 129 states and 154 transitions. Second operand 9 states. [2021-01-07 05:28:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:49,944 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2021-01-07 05:28:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:28:49,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-07 05:28:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:49,946 INFO L225 Difference]: With dead ends: 147 [2021-01-07 05:28:49,946 INFO L226 Difference]: Without dead ends: 147 [2021-01-07 05:28:49,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:28:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-07 05:28:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2021-01-07 05:28:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:28:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2021-01-07 05:28:49,950 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 22 [2021-01-07 05:28:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:49,951 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2021-01-07 05:28:49,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:28:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2021-01-07 05:28:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:28:49,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:49,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:49,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:28:49,952 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 462913672, now seen corresponding path program 1 times [2021-01-07 05:28:49,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:49,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420970805] [2021-01-07 05:28:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:50,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420970805] [2021-01-07 05:28:50,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:50,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:28:50,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929434796] [2021-01-07 05:28:50,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:28:50,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:28:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:28:50,003 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 6 states. [2021-01-07 05:28:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:50,194 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2021-01-07 05:28:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:28:50,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-07 05:28:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:50,196 INFO L225 Difference]: With dead ends: 132 [2021-01-07 05:28:50,196 INFO L226 Difference]: Without dead ends: 132 [2021-01-07 05:28:50,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:28:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-07 05:28:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2021-01-07 05:28:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-07 05:28:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2021-01-07 05:28:50,201 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 23 [2021-01-07 05:28:50,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:50,202 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2021-01-07 05:28:50,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:28:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2021-01-07 05:28:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:28:50,202 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:50,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:50,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:28:50,203 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 462913673, now seen corresponding path program 1 times [2021-01-07 05:28:50,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:50,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046987580] [2021-01-07 05:28:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:50,397 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:28:50,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046987580] [2021-01-07 05:28:50,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375412968] [2021-01-07 05:28:50,402 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:28:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:50,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 05:28:50,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:28:50,755 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-01-07 05:28:50,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:50,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:50,775 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-01-07 05:28:50,778 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:50,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:50,784 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:50,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2021-01-07 05:28:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:50,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:28:50,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-01-07 05:28:50,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571299484] [2021-01-07 05:28:50,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:28:50,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:28:50,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:28:50,830 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 6 states. [2021-01-07 05:28:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:51,139 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2021-01-07 05:28:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:28:51,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-07 05:28:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:51,142 INFO L225 Difference]: With dead ends: 130 [2021-01-07 05:28:51,143 INFO L226 Difference]: Without dead ends: 130 [2021-01-07 05:28:51,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:28:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-01-07 05:28:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-01-07 05:28:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-07 05:28:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2021-01-07 05:28:51,152 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 23 [2021-01-07 05:28:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:51,153 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2021-01-07 05:28:51,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:28:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2021-01-07 05:28:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:28:51,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:51,159 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:51,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 05:28:51,360 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1839091055, now seen corresponding path program 1 times [2021-01-07 05:28:51,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:51,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903614627] [2021-01-07 05:28:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:51,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903614627] [2021-01-07 05:28:51,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665126912] [2021-01-07 05:28:51,545 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:28:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:51,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:28:51,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:28:51,652 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:28:51,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,656 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,656 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:28:51,681 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,682 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 15 [2021-01-07 05:28:51,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:28:51,697 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2021-01-07 05:28:51,751 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:28:51,752 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2021-01-07 05:28:51,883 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,883 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2021-01-07 05:28:51,887 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,896 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,896 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2021-01-07 05:28:51,959 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:28:51,960 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:28:51,962 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,970 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:51,971 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:51,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2021-01-07 05:28:52,041 INFO L348 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2021-01-07 05:28:52,042 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2021-01-07 05:28:52,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:28:52,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:28:52,052 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:52,059 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:52,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:28:52,061 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2021-01-07 05:28:52,127 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:52,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2021-01-07 05:28:52,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:52,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:52,137 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:52,137 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2021-01-07 05:28:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:52,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:28:52,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2021-01-07 05:28:52,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852654575] [2021-01-07 05:28:52,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-07 05:28:52,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-07 05:28:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-01-07 05:28:52,148 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 18 states. [2021-01-07 05:28:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:53,230 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2021-01-07 05:28:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:28:53,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2021-01-07 05:28:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:53,232 INFO L225 Difference]: With dead ends: 231 [2021-01-07 05:28:53,232 INFO L226 Difference]: Without dead ends: 231 [2021-01-07 05:28:53,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:28:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-07 05:28:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 150. [2021-01-07 05:28:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-01-07 05:28:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2021-01-07 05:28:53,238 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2021-01-07 05:28:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:53,238 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2021-01-07 05:28:53,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-07 05:28:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2021-01-07 05:28:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:28:53,239 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:53,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:53,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 05:28:53,453 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1558470753, now seen corresponding path program 1 times [2021-01-07 05:28:53,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:53,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083522304] [2021-01-07 05:28:53,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:53,640 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:28:53,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083522304] [2021-01-07 05:28:53,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:28:53,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 05:28:53,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715853498] [2021-01-07 05:28:53,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:28:53,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:28:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:28:53,643 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand 11 states. [2021-01-07 05:28:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:28:54,176 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2021-01-07 05:28:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:28:54,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2021-01-07 05:28:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:28:54,178 INFO L225 Difference]: With dead ends: 162 [2021-01-07 05:28:54,178 INFO L226 Difference]: Without dead ends: 162 [2021-01-07 05:28:54,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:28:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-07 05:28:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2021-01-07 05:28:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2021-01-07 05:28:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2021-01-07 05:28:54,183 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 24 [2021-01-07 05:28:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:28:54,184 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2021-01-07 05:28:54,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:28:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2021-01-07 05:28:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:28:54,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:28:54,184 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:28:54,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:28:54,185 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:28:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:28:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1177243695, now seen corresponding path program 1 times [2021-01-07 05:28:54,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:28:54,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469874198] [2021-01-07 05:28:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:28:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:54,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469874198] [2021-01-07 05:28:54,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357133061] [2021-01-07 05:28:54,327 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:28:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:28:54,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-07 05:28:54,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:28:54,461 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:28:54,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:28:54,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:28:54,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:28:54,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:28:54,480 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,491 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,491 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-01-07 05:28:54,532 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:28:54,533 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,546 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,547 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2021-01-07 05:28:54,658 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,659 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2021-01-07 05:28:54,663 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,677 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2021-01-07 05:28:54,737 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:28:54,738 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 34 treesize of output 21 [2021-01-07 05:28:54,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,751 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,753 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2021-01-07 05:28:54,836 INFO L348 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2021-01-07 05:28:54,836 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2021-01-07 05:28:54,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2021-01-07 05:28:54,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:28:54,843 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,854 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:28:54,854 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2021-01-07 05:28:54,913 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,914 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-01-07 05:28:54,916 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:28:54,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:28:54,925 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:28:54,925 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2021-01-07 05:28:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:28:55,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:28:55,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2021-01-07 05:28:55,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023647506] [2021-01-07 05:28:55,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:28:55,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:28:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:28:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:28:55,017 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 22 states. [2021-01-07 05:29:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:10,497 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2021-01-07 05:29:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:29:10,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2021-01-07 05:29:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:10,500 INFO L225 Difference]: With dead ends: 225 [2021-01-07 05:29:10,501 INFO L226 Difference]: Without dead ends: 225 [2021-01-07 05:29:10,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2021-01-07 05:29:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-01-07 05:29:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 151. [2021-01-07 05:29:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-07 05:29:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2021-01-07 05:29:10,507 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 24 [2021-01-07 05:29:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:10,507 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2021-01-07 05:29:10,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:29:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2021-01-07 05:29:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:29:10,508 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:10,508 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:10,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:29:10,710 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:10,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:10,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1177243694, now seen corresponding path program 1 times [2021-01-07 05:29:10,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:10,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915022056] [2021-01-07 05:29:10,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:10,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915022056] [2021-01-07 05:29:10,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691777265] [2021-01-07 05:29:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:11,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-07 05:29:11,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:11,026 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:29:11,027 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,030 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:29:11,044 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_44|], 1=[|v_#valid_57|]} [2021-01-07 05:29:11,050 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:29:11,051 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,075 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,077 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:29:11,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:29:11,082 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,093 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2021-01-07 05:29:11,117 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:29:11,118 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:29:11,140 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,155 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2021-01-07 05:29:11,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:11,270 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 26 treesize of output 21 [2021-01-07 05:29:11,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,310 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2021-01-07 05:29:11,313 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,329 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2021-01-07 05:29:11,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:11,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:29:11,387 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:11,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2021-01-07 05:29:11,420 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,438 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,439 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,440 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-01-07 05:29:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:11,539 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,540 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 124 [2021-01-07 05:29:11,544 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-07 05:29:11,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:29:11,546 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,567 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:11,574 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2021-01-07 05:29:11,576 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,593 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:11,594 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:61 [2021-01-07 05:29:11,674 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,675 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2021-01-07 05:29:11,677 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,696 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-01-07 05:29:11,698 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:11,710 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:11,710 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:14 [2021-01-07 05:29:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:11,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:11,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-01-07 05:29:11,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139685970] [2021-01-07 05:29:11,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:29:11,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:29:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:29:11,722 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 17 states. [2021-01-07 05:29:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:13,035 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2021-01-07 05:29:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:29:13,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2021-01-07 05:29:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:13,038 INFO L225 Difference]: With dead ends: 225 [2021-01-07 05:29:13,038 INFO L226 Difference]: Without dead ends: 225 [2021-01-07 05:29:13,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:29:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-01-07 05:29:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 164. [2021-01-07 05:29:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-01-07 05:29:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2021-01-07 05:29:13,045 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 24 [2021-01-07 05:29:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:13,045 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2021-01-07 05:29:13,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:29:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2021-01-07 05:29:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:29:13,046 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:13,046 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:13,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:13,260 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1816557523, now seen corresponding path program 1 times [2021-01-07 05:29:13,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:13,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586188305] [2021-01-07 05:29:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:13,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586188305] [2021-01-07 05:29:13,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313931592] [2021-01-07 05:29:13,468 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:29:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:13,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 05:29:13,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:13,689 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-01-07 05:29:13,690 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:13,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:13,698 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-01-07 05:29:13,700 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:13,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:13,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:13,703 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2021-01-07 05:29:13,752 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-01-07 05:29:13,754 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:13,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:13,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:13,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2021-01-07 05:29:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:13,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:29:13,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2021-01-07 05:29:13,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196161700] [2021-01-07 05:29:13,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:29:13,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:29:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:29:13,801 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand 9 states. [2021-01-07 05:29:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:14,237 INFO L93 Difference]: Finished difference Result 184 states and 214 transitions. [2021-01-07 05:29:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:29:14,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2021-01-07 05:29:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:14,239 INFO L225 Difference]: With dead ends: 184 [2021-01-07 05:29:14,239 INFO L226 Difference]: Without dead ends: 184 [2021-01-07 05:29:14,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:29:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-01-07 05:29:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2021-01-07 05:29:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:29:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2021-01-07 05:29:14,251 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 25 [2021-01-07 05:29:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:14,251 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2021-01-07 05:29:14,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:29:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2021-01-07 05:29:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:29:14,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:14,252 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:14,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:29:14,467 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1436097983, now seen corresponding path program 1 times [2021-01-07 05:29:14,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:14,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872044818] [2021-01-07 05:29:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:14,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872044818] [2021-01-07 05:29:14,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335926009] [2021-01-07 05:29:14,698 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:29:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:14,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2021-01-07 05:29:14,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:14,795 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:29:14,796 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,799 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:29:14,809 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 3=[|v_#valid_59|]} [2021-01-07 05:29:14,814 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:29:14,815 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,853 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,853 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 05:29:14,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:29:14,859 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,876 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,876 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2021-01-07 05:29:14,924 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:29:14,925 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,949 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:29:14,950 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:14,969 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:14,970 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2021-01-07 05:29:15,018 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:29:15,019 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2021-01-07 05:29:15,131 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,132 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2021-01-07 05:29:15,134 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,150 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:37 [2021-01-07 05:29:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:15,206 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:29:15,214 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,229 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,229 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:37 [2021-01-07 05:29:15,270 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 86 [2021-01-07 05:29:15,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:29:15,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:29:15,276 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,288 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:43 [2021-01-07 05:29:15,491 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-01-07 05:29:15,493 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:15,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,508 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:29:15,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:44 [2021-01-07 05:29:15,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:29:15,608 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,608 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 46 [2021-01-07 05:29:15,611 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:29:15,612 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:29:15,615 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:29:15,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:15,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:15,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2021-01-07 05:29:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:15,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:15,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-01-07 05:29:15,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339753614] [2021-01-07 05:29:15,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:29:15,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:29:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:29:15,682 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand 23 states. [2021-01-07 05:29:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:25,151 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2021-01-07 05:29:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:29:25,152 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2021-01-07 05:29:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:25,153 INFO L225 Difference]: With dead ends: 243 [2021-01-07 05:29:25,153 INFO L226 Difference]: Without dead ends: 243 [2021-01-07 05:29:25,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=199, Invalid=1059, Unknown=2, NotChecked=0, Total=1260 [2021-01-07 05:29:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-01-07 05:29:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 179. [2021-01-07 05:29:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:29:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2021-01-07 05:29:25,160 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 27 [2021-01-07 05:29:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:25,160 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2021-01-07 05:29:25,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:29:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2021-01-07 05:29:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:29:25,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:25,161 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:25,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:29:25,375 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1436097984, now seen corresponding path program 1 times [2021-01-07 05:29:25,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:25,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288868953] [2021-01-07 05:29:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:25,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288868953] [2021-01-07 05:29:25,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835617738] [2021-01-07 05:29:25,676 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:29:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:25,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:29:25,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:25,758 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:29:25,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:25,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:25,761 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:25,762 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:29:25,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:25,880 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 14 treesize of output 16 [2021-01-07 05:29:25,882 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:25,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:25,912 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:25,913 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:29:25,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:29:25,916 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:25,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:25,933 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:25,933 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2021-01-07 05:29:25,982 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:29:25,982 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,001 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:29:26,007 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,030 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,030 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2021-01-07 05:29:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:26,193 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 26 treesize of output 21 [2021-01-07 05:29:26,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,237 INFO L625 ElimStorePlain]: treesize reduction 3, result has 95.7 percent of original size [2021-01-07 05:29:26,264 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,264 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2021-01-07 05:29:26,266 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,293 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:55 [2021-01-07 05:29:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:26,384 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2021-01-07 05:29:26,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:26,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2021-01-07 05:29:26,420 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,444 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,444 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:51 [2021-01-07 05:29:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:26,548 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,548 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 157 [2021-01-07 05:29:26,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-07 05:29:26,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:29:26,554 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,595 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,595 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 95 [2021-01-07 05:29:26,601 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,618 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:26,618 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:65 [2021-01-07 05:29:26,978 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:26,979 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 57 [2021-01-07 05:29:26,981 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:29:26,984 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:29:27,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:27,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2021-01-07 05:29:27,009 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:27,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:27,023 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:27,024 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:20 [2021-01-07 05:29:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:27,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:27,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-01-07 05:29:27,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123136789] [2021-01-07 05:29:27,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:29:27,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:29:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:29:27,090 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 27 states. [2021-01-07 05:29:30,257 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2021-01-07 05:29:30,833 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-01-07 05:29:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:31,803 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2021-01-07 05:29:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:29:31,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2021-01-07 05:29:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:31,806 INFO L225 Difference]: With dead ends: 244 [2021-01-07 05:29:31,806 INFO L226 Difference]: Without dead ends: 244 [2021-01-07 05:29:31,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=242, Invalid=1239, Unknown=1, NotChecked=0, Total=1482 [2021-01-07 05:29:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-01-07 05:29:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2021-01-07 05:29:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:29:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2021-01-07 05:29:31,812 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 27 [2021-01-07 05:29:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:31,813 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2021-01-07 05:29:31,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:29:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2021-01-07 05:29:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:29:31,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:31,813 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:32,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:29:32,021 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:32,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1569349705, now seen corresponding path program 1 times [2021-01-07 05:29:32,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:32,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233086623] [2021-01-07 05:29:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:29:32,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233086623] [2021-01-07 05:29:32,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:29:32,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 05:29:32,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722736530] [2021-01-07 05:29:32,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:29:32,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:29:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:29:32,087 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 7 states. [2021-01-07 05:29:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:32,392 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2021-01-07 05:29:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:29:32,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2021-01-07 05:29:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:32,395 INFO L225 Difference]: With dead ends: 216 [2021-01-07 05:29:32,395 INFO L226 Difference]: Without dead ends: 216 [2021-01-07 05:29:32,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:29:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-07 05:29:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 180. [2021-01-07 05:29:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2021-01-07 05:29:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2021-01-07 05:29:32,400 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 28 [2021-01-07 05:29:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:32,401 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2021-01-07 05:29:32,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:29:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2021-01-07 05:29:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:29:32,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:32,402 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:32,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-07 05:29:32,402 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:32,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1569349706, now seen corresponding path program 1 times [2021-01-07 05:29:32,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:32,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242512694] [2021-01-07 05:29:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:32,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242512694] [2021-01-07 05:29:32,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094027800] [2021-01-07 05:29:32,632 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:29:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:32,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 05:29:32,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:32,822 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-01-07 05:29:32,823 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:32,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:32,833 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-01-07 05:29:32,835 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:32,840 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:32,840 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:32,841 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2021-01-07 05:29:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:29:32,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:29:32,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2021-01-07 05:29:32,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849176399] [2021-01-07 05:29:32,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:29:32,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:29:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:29:32,899 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand 7 states. [2021-01-07 05:29:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:33,334 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2021-01-07 05:29:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 05:29:33,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2021-01-07 05:29:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:33,337 INFO L225 Difference]: With dead ends: 218 [2021-01-07 05:29:33,337 INFO L226 Difference]: Without dead ends: 218 [2021-01-07 05:29:33,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-01-07 05:29:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-01-07 05:29:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 180. [2021-01-07 05:29:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2021-01-07 05:29:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2021-01-07 05:29:33,342 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 28 [2021-01-07 05:29:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:33,342 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2021-01-07 05:29:33,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:29:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2021-01-07 05:29:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:29:33,343 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:33,343 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:33,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-07 05:29:33,557 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:33,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1604808805, now seen corresponding path program 1 times [2021-01-07 05:29:33,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:33,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817024684] [2021-01-07 05:29:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:33,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817024684] [2021-01-07 05:29:33,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237007505] [2021-01-07 05:29:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:33,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-07 05:29:33,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:33,838 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:29:33,839 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,850 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:29:33,851 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,858 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2021-01-07 05:29:33,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:33,887 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 27 treesize of output 11 [2021-01-07 05:29:33,889 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,898 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:33,903 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 27 treesize of output 11 [2021-01-07 05:29:33,904 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,912 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,912 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2021-01-07 05:29:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:33,958 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 27 treesize of output 11 [2021-01-07 05:29:33,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:33,978 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 27 treesize of output 11 [2021-01-07 05:29:33,981 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:33,991 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:33,991 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:18 [2021-01-07 05:29:34,002 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:29:34,003 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:34,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:34,014 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:34,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2021-01-07 05:29:34,164 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:34,165 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-01-07 05:29:34,166 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:34,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:34,172 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:34,172 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2021-01-07 05:29:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:34,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:34,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2021-01-07 05:29:34,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128923305] [2021-01-07 05:29:34,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:29:34,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:29:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:29:34,187 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 16 states. [2021-01-07 05:29:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:35,113 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2021-01-07 05:29:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:29:35,114 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2021-01-07 05:29:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:35,115 INFO L225 Difference]: With dead ends: 209 [2021-01-07 05:29:35,115 INFO L226 Difference]: Without dead ends: 209 [2021-01-07 05:29:35,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=599, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:29:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-07 05:29:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 179. [2021-01-07 05:29:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:29:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2021-01-07 05:29:35,122 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 29 [2021-01-07 05:29:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:35,122 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2021-01-07 05:29:35,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:29:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2021-01-07 05:29:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:29:35,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:35,123 INFO L422 BasicCegarLoop]: trace histogram [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:29:35,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:35,336 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1790534544, now seen corresponding path program 1 times [2021-01-07 05:29:35,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:35,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223522845] [2021-01-07 05:29:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:35,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223522845] [2021-01-07 05:29:35,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285576539] [2021-01-07 05:29:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:35,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 35 conjunts are in the unsatisfiable core [2021-01-07 05:29:35,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:35,622 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:29:35,623 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,625 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,625 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:29:35,645 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:29:35,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,657 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:29:35,658 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,664 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,665 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,665 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-01-07 05:29:35,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:35,681 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 36 treesize of output 16 [2021-01-07 05:29:35,682 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,692 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:35,698 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 27 treesize of output 11 [2021-01-07 05:29:35,700 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,707 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,707 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:24 [2021-01-07 05:29:35,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:35,752 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 27 treesize of output 11 [2021-01-07 05:29:35,753 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:35,770 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 36 treesize of output 16 [2021-01-07 05:29:35,771 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,781 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,781 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:20 [2021-01-07 05:29:35,949 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,949 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2021-01-07 05:29:35,951 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:35,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:35,961 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:35,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:28 [2021-01-07 05:29:36,091 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:36,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2021-01-07 05:29:36,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:36,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:36,101 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:36,101 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2021-01-07 05:29:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:36,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:36,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-01-07 05:29:36,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987060565] [2021-01-07 05:29:36,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:29:36,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:29:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:29:36,112 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 17 states. [2021-01-07 05:29:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:37,112 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2021-01-07 05:29:37,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 05:29:37,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2021-01-07 05:29:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:37,115 INFO L225 Difference]: With dead ends: 216 [2021-01-07 05:29:37,115 INFO L226 Difference]: Without dead ends: 216 [2021-01-07 05:29:37,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:29:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-01-07 05:29:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2021-01-07 05:29:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2021-01-07 05:29:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2021-01-07 05:29:37,120 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 30 [2021-01-07 05:29:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:37,121 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2021-01-07 05:29:37,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:29:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2021-01-07 05:29:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:29:37,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:37,122 INFO L422 BasicCegarLoop]: trace histogram [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:29:37,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:37,336 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1790534543, now seen corresponding path program 1 times [2021-01-07 05:29:37,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:37,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434086951] [2021-01-07 05:29:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:37,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434086951] [2021-01-07 05:29:37,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700650137] [2021-01-07 05:29:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:37,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 37 conjunts are in the unsatisfiable core [2021-01-07 05:29:37,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:37,611 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:29:37,611 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,618 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,621 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:29:37,621 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,631 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2021-01-07 05:29:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:37,657 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 27 treesize of output 11 [2021-01-07 05:29:37,659 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:37,673 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 27 treesize of output 11 [2021-01-07 05:29:37,674 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,682 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,682 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2021-01-07 05:29:37,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:37,726 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 27 treesize of output 11 [2021-01-07 05:29:37,727 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:29:37,744 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 27 treesize of output 11 [2021-01-07 05:29:37,745 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:37,756 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:37,756 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:18 [2021-01-07 05:29:42,907 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:42,907 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 40 [2021-01-07 05:29:42,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:42,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:42,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:42,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-01-07 05:29:42,929 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:42,937 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:42,938 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:42,939 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2021-01-07 05:29:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:29:42,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:42,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-01-07 05:29:42,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761088109] [2021-01-07 05:29:42,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-07 05:29:42,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-07 05:29:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=257, Unknown=3, NotChecked=0, Total=306 [2021-01-07 05:29:42,983 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand 18 states. [2021-01-07 05:29:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:56,646 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2021-01-07 05:29:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:29:56,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2021-01-07 05:29:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:56,648 INFO L225 Difference]: With dead ends: 194 [2021-01-07 05:29:56,648 INFO L226 Difference]: Without dead ends: 194 [2021-01-07 05:29:56,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=121, Invalid=427, Unknown=4, NotChecked=0, Total=552 [2021-01-07 05:29:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-01-07 05:29:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2021-01-07 05:29:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2021-01-07 05:29:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2021-01-07 05:29:56,654 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 30 [2021-01-07 05:29:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:56,655 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2021-01-07 05:29:56,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-07 05:29:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2021-01-07 05:29:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 05:29:56,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:56,655 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:56,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-07 05:29:56,870 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 611550072, now seen corresponding path program 1 times [2021-01-07 05:29:56,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:56,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897669274] [2021-01-07 05:29:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:57,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897669274] [2021-01-07 05:29:57,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008830874] [2021-01-07 05:29:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:29:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:57,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-07 05:29:57,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:29:57,260 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:29:57,261 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 05:29:57,285 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,286 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:29:57,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:29:57,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,298 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,299 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-01-07 05:29:57,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:29:57,332 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,347 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:29:57,348 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,360 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,360 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2021-01-07 05:29:57,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-01-07 05:29:57,393 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,398 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-01-07 05:29:57,450 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 19 treesize of output 18 [2021-01-07 05:29:57,452 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,459 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-01-07 05:29:57,504 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:29:57,504 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 34 treesize of output 21 [2021-01-07 05:29:57,505 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,513 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:19 [2021-01-07 05:29:57,536 INFO L348 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-01-07 05:29:57,537 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 34 treesize of output 21 [2021-01-07 05:29:57,538 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,547 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:29:57,547 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2021-01-07 05:29:57,704 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2021-01-07 05:29:57,706 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,710 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:29:57,712 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:29:57,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:3 [2021-01-07 05:29:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:29:57,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:29:57,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2021-01-07 05:29:57,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61813220] [2021-01-07 05:29:57,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:29:57,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:29:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:29:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:29:57,768 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 22 states. [2021-01-07 05:29:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:29:59,605 INFO L93 Difference]: Finished difference Result 241 states and 266 transitions. [2021-01-07 05:29:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-07 05:29:59,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2021-01-07 05:29:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:29:59,609 INFO L225 Difference]: With dead ends: 241 [2021-01-07 05:29:59,609 INFO L226 Difference]: Without dead ends: 241 [2021-01-07 05:29:59,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:29:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-01-07 05:29:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 200. [2021-01-07 05:29:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2021-01-07 05:29:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2021-01-07 05:29:59,617 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 30 [2021-01-07 05:29:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:29:59,617 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2021-01-07 05:29:59,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:29:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2021-01-07 05:29:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:29:59,618 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:29:59,619 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:29:59,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-07 05:29:59,833 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:29:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:29:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1778183266, now seen corresponding path program 1 times [2021-01-07 05:29:59,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:29:59,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839722332] [2021-01-07 05:29:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:29:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:29:59,889 ERROR L253 erpolLogProxyWrapper]: Interpolant 8 not inductive [2021-01-07 05:29:59,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-07 05:29:59,914 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:228) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateAllErrorsAtOnce(TraceAbstractionStarter.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-01-07 05:29:59,925 INFO L168 Benchmark]: Toolchain (without parser) took 80217.57 ms. Allocated memory was 155.2 MB in the beginning and 327.2 MB in the end (delta: 172.0 MB). Free memory was 128.8 MB in the beginning and 298.5 MB in the end (delta: -169.6 MB). Peak memory consumption was 3.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:29:59,926 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:29:59,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.12 ms. Allocated memory is still 155.2 MB. Free memory was 128.6 MB in the beginning and 106.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-07 05:29:59,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.92 ms. Allocated memory is still 155.2 MB. Free memory was 106.2 MB in the beginning and 104.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-07 05:29:59,927 INFO L168 Benchmark]: Boogie Preprocessor took 87.28 ms. Allocated memory is still 155.2 MB. Free memory was 104.3 MB in the beginning and 138.2 MB in the end (delta: -33.9 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. [2021-01-07 05:29:59,927 INFO L168 Benchmark]: RCFGBuilder took 761.26 ms. Allocated memory is still 155.2 MB. Free memory was 138.2 MB in the beginning and 106.5 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2021-01-07 05:29:59,928 INFO L168 Benchmark]: TraceAbstraction took 78668.08 ms. Allocated memory was 155.2 MB in the beginning and 327.2 MB in the end (delta: 172.0 MB). Free memory was 105.9 MB in the beginning and 298.5 MB in the end (delta: -192.5 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 05:29:59,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 624.12 ms. Allocated memory is still 155.2 MB. Free memory was 128.6 MB in the beginning and 106.4 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.92 ms. Allocated memory is still 155.2 MB. Free memory was 106.2 MB in the beginning and 104.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 87.28 ms. Allocated memory is still 155.2 MB. Free memory was 104.3 MB in the beginning and 138.2 MB in the end (delta: -33.9 MB). Peak memory consumption was 4.7 MB. Max. memory is 8.0 GB. * RCFGBuilder took 761.26 ms. Allocated memory is still 155.2 MB. Free memory was 138.2 MB in the beginning and 106.5 MB in the end (delta: 31.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 78668.08 ms. Allocated memory was 155.2 MB in the beginning and 327.2 MB in the end (delta: 172.0 MB). Free memory was 105.9 MB in the beginning and 298.5 MB in the end (delta: -192.5 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:228) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...