/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:07:17,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:07:17,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:07:17,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:07:17,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:07:17,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:07:17,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:07:17,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:07:17,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:07:17,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:07:17,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:07:17,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:07:17,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:07:17,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:07:17,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:07:17,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:07:17,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:07:17,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:07:17,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:07:17,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:07:17,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:07:17,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:07:17,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:07:17,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:07:17,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:07:17,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:07:17,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:07:17,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:07:17,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:07:17,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:07:17,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:07:17,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:07:17,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:07:17,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:07:17,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:07:17,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:07:17,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:07:17,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:07:17,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:07:17,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:07:17,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:07:17,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:07:17,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:07:17,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:07:17,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:07:17,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:07:17,775 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:07:17,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:07:17,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:07:17,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:07:17,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:07:17,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:07:17,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:07:17,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:07:17,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:07:17,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:07:17,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:07:17,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:07:17,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:07:17,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:07:17,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:07:17,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:07:17,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:07:17,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:07:17,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:07:17,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:07:17,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:07:17,781 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-06 16:07:18,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:07:18,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:07:18,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:07:18,264 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:07:18,267 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:07:18,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2021-01-06 16:07:18,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dda9fef87/f9e6af383b40421c9f3b1718043f1207/FLAG28a97bdb1 [2021-01-06 16:07:19,095 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:07:19,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2021-01-06 16:07:19,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dda9fef87/f9e6af383b40421c9f3b1718043f1207/FLAG28a97bdb1 [2021-01-06 16:07:19,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dda9fef87/f9e6af383b40421c9f3b1718043f1207 [2021-01-06 16:07:19,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:07:19,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:07:19,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:07:19,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:07:19,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:07:19,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:07:19" (1/1) ... [2021-01-06 16:07:19,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eeefb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:19, skipping insertion in model container [2021-01-06 16:07:19,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:07:19" (1/1) ... [2021-01-06 16:07:19,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:07:19,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:07:19,665 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/heap-manipulation/dancing.i[938,951] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],L] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],R] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tail~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~tail~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-06 16:07:19,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:07:19,901 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:07:19,921 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/heap-manipulation/dancing.i[938,951] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tail~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~tail~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-06 16:07:19,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:07:20,064 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:07:20,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20 WrapperNode [2021-01-06 16:07:20,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:07:20,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:07:20,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:07:20,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:07:20,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:07:20,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:07:20,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:07:20,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:07:20,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (1/1) ... [2021-01-06 16:07:20,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:07:20,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:07:20,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:07:20,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:07:20,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (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-06 16:07:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2021-01-06 16:07:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2021-01-06 16:07:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:07:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:07:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:07:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:07:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:07:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:07:20,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:07:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:07:21,077 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:07:21,077 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-06 16:07:21,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:07:21 BoogieIcfgContainer [2021-01-06 16:07:21,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:07:21,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:07:21,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:07:21,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:07:21,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:07:19" (1/3) ... [2021-01-06 16:07:21,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7941ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:07:21, skipping insertion in model container [2021-01-06 16:07:21,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:07:20" (2/3) ... [2021-01-06 16:07:21,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7941ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:07:21, skipping insertion in model container [2021-01-06 16:07:21,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:07:21" (3/3) ... [2021-01-06 16:07:21,090 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2021-01-06 16:07:21,098 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:07:21,104 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 16:07:21,127 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 16:07:21,155 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:07:21,155 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:07:21,155 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:07:21,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:07:21,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:07:21,156 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:07:21,156 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:07:21,156 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:07:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2021-01-06 16:07:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:07:21,182 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:21,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:07:21,184 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 206559279, now seen corresponding path program 1 times [2021-01-06 16:07:21,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:21,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818609268] [2021-01-06 16:07:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,458 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-06 16:07:21,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818609268] [2021-01-06 16:07:21,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:21,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:07:21,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12340665] [2021-01-06 16:07:21,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:07:21,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:07:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:07:21,495 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2021-01-06 16:07:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:21,545 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2021-01-06 16:07:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:07:21,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2021-01-06 16:07:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:21,556 INFO L225 Difference]: With dead ends: 75 [2021-01-06 16:07:21,556 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 16:07:21,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:07:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 16:07:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-01-06 16:07:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-01-06 16:07:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2021-01-06 16:07:21,612 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 19 [2021-01-06 16:07:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:21,613 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2021-01-06 16:07:21,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:07:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2021-01-06 16:07:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:07:21,615 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:21,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:07:21,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:07:21,616 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:21,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1381750304, now seen corresponding path program 1 times [2021-01-06 16:07:21,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:21,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741349001] [2021-01-06 16:07:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,780 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-06 16:07:21,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741349001] [2021-01-06 16:07:21,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:21,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:07:21,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848624948] [2021-01-06 16:07:21,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:07:21,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:21,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:07:21,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:07:21,786 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 4 states. [2021-01-06 16:07:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:21,839 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2021-01-06 16:07:21,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:07:21,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2021-01-06 16:07:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:21,842 INFO L225 Difference]: With dead ends: 41 [2021-01-06 16:07:21,842 INFO L226 Difference]: Without dead ends: 39 [2021-01-06 16:07:21,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 16:07:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-01-06 16:07:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-01-06 16:07:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-01-06 16:07:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2021-01-06 16:07:21,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 19 [2021-01-06 16:07:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:21,855 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-01-06 16:07:21,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:07:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2021-01-06 16:07:21,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 16:07:21,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:21,858 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] [2021-01-06 16:07:21,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:07:21,858 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:21,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:21,859 INFO L82 PathProgramCache]: Analyzing trace with hash -226254050, now seen corresponding path program 1 times [2021-01-06 16:07:21,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:21,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82161429] [2021-01-06 16:07:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-01-06 16:07:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:07:21,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82161429] [2021-01-06 16:07:21,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:21,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:07:21,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8150678] [2021-01-06 16:07:21,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:07:21,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:07:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:07:21,982 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 4 states. [2021-01-06 16:07:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:22,085 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2021-01-06 16:07:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:07:22,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-01-06 16:07:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:22,087 INFO L225 Difference]: With dead ends: 84 [2021-01-06 16:07:22,088 INFO L226 Difference]: Without dead ends: 62 [2021-01-06 16:07:22,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-06 16:07:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-01-06 16:07:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2021-01-06 16:07:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-01-06 16:07:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2021-01-06 16:07:22,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 25 [2021-01-06 16:07:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:22,120 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2021-01-06 16:07:22,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:07:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2021-01-06 16:07:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 16:07:22,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:22,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] [2021-01-06 16:07:22,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:07:22,123 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1609419466, now seen corresponding path program 1 times [2021-01-06 16:07:22,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:22,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740996004] [2021-01-06 16:07:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 16:07:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-01-06 16:07:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:07:22,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740996004] [2021-01-06 16:07:22,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664150135] [2021-01-06 16:07:22,245 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-06 16:07:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:22,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 16:07:22,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:07:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:07:22,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:07:22,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-06 16:07:22,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223743991] [2021-01-06 16:07:22,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 16:07:22,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 16:07:22,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-01-06 16:07:22,661 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand 12 states. [2021-01-06 16:07:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:23,059 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2021-01-06 16:07:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:07:23,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2021-01-06 16:07:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:23,063 INFO L225 Difference]: With dead ends: 116 [2021-01-06 16:07:23,064 INFO L226 Difference]: Without dead ends: 84 [2021-01-06 16:07:23,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:07:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-06 16:07:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2021-01-06 16:07:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-01-06 16:07:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2021-01-06 16:07:23,077 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 28 [2021-01-06 16:07:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:23,078 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2021-01-06 16:07:23,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 16:07:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2021-01-06 16:07:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 16:07:23,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:23,080 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-06 16:07:23,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:07:23,298 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -348378523, now seen corresponding path program 1 times [2021-01-06 16:07:23,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:23,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265844220] [2021-01-06 16:07:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 16:07:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:07:23,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265844220] [2021-01-06 16:07:23,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:23,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:07:23,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232667063] [2021-01-06 16:07:23,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:07:23,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:23,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:07:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:07:23,587 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 6 states. [2021-01-06 16:07:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:23,786 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2021-01-06 16:07:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:07:23,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2021-01-06 16:07:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:23,788 INFO L225 Difference]: With dead ends: 103 [2021-01-06 16:07:23,789 INFO L226 Difference]: Without dead ends: 81 [2021-01-06 16:07:23,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:07:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-06 16:07:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2021-01-06 16:07:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-06 16:07:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2021-01-06 16:07:23,802 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 30 [2021-01-06 16:07:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:23,802 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2021-01-06 16:07:23,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:07:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2021-01-06 16:07:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 16:07:23,804 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:23,804 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-06 16:07:23,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:07:23,805 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1936726425, now seen corresponding path program 1 times [2021-01-06 16:07:23,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:23,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504550531] [2021-01-06 16:07:23,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 16:07:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 16:07:23,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504550531] [2021-01-06 16:07:23,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:23,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:07:23,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222580706] [2021-01-06 16:07:23,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:07:23,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:07:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:07:23,929 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand 5 states. [2021-01-06 16:07:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:23,967 INFO L93 Difference]: Finished difference Result 72 states and 99 transitions. [2021-01-06 16:07:23,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:07:23,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-06 16:07:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:23,970 INFO L225 Difference]: With dead ends: 72 [2021-01-06 16:07:23,970 INFO L226 Difference]: Without dead ends: 68 [2021-01-06 16:07:23,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:07:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-01-06 16:07:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2021-01-06 16:07:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-06 16:07:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2021-01-06 16:07:23,998 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 30 [2021-01-06 16:07:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:23,999 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2021-01-06 16:07:23,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:07:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2021-01-06 16:07:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 16:07:24,001 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:24,001 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:07:24,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:07:24,001 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash -829447446, now seen corresponding path program 1 times [2021-01-06 16:07:24,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:24,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69527381] [2021-01-06 16:07:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 16:07:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-01-06 16:07:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:07:24,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69527381] [2021-01-06 16:07:24,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:24,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:07:24,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43673938] [2021-01-06 16:07:24,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:07:24,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:07:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:07:24,130 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand 6 states. [2021-01-06 16:07:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:24,219 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2021-01-06 16:07:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:07:24,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2021-01-06 16:07:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:24,221 INFO L225 Difference]: With dead ends: 70 [2021-01-06 16:07:24,221 INFO L226 Difference]: Without dead ends: 68 [2021-01-06 16:07:24,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:07:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-01-06 16:07:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2021-01-06 16:07:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-06 16:07:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2021-01-06 16:07:24,231 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 30 [2021-01-06 16:07:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:24,232 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2021-01-06 16:07:24,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:07:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2021-01-06 16:07:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:07:24,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:24,233 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:07:24,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:07:24,234 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 945306828, now seen corresponding path program 1 times [2021-01-06 16:07:24,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:24,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609178865] [2021-01-06 16:07:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 16:07:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 16:07:24,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609178865] [2021-01-06 16:07:24,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:07:24,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:07:24,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763951295] [2021-01-06 16:07:24,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:07:24,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:24,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:07:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:07:24,335 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand 5 states. [2021-01-06 16:07:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:24,464 INFO L93 Difference]: Finished difference Result 107 states and 148 transitions. [2021-01-06 16:07:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:07:24,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2021-01-06 16:07:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:24,467 INFO L225 Difference]: With dead ends: 107 [2021-01-06 16:07:24,467 INFO L226 Difference]: Without dead ends: 48 [2021-01-06 16:07:24,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:07:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-06 16:07:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-01-06 16:07:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 16:07:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-01-06 16:07:24,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 31 [2021-01-06 16:07:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:24,482 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-01-06 16:07:24,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:07:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2021-01-06 16:07:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 16:07:24,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:24,487 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-06 16:07:24,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:07:24,487 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1429407123, now seen corresponding path program 1 times [2021-01-06 16:07:24,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:24,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667844716] [2021-01-06 16:07:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 16:07:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-01-06 16:07:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 16:07:24,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667844716] [2021-01-06 16:07:24,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303697593] [2021-01-06 16:07:24,627 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-06 16:07:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:24,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-06 16:07:24,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:07:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:24,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:24,912 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 39 treesize of output 26 [2021-01-06 16:07:24,915 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:24,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:24,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:24,951 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 39 treesize of output 26 [2021-01-06 16:07:24,953 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:24,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:24,978 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-06 16:07:24,979 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:65 [2021-01-06 16:07:25,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:25,277 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:25,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2021-01-06 16:07:25,283 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:07:25,290 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-06 16:07:25,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:25,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:25,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2021-01-06 16:07:25,314 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:25,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:25,326 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-06 16:07:25,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:10 [2021-01-06 16:07:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 16:07:25,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:07:25,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2021-01-06 16:07:25,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751878896] [2021-01-06 16:07:25,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:07:25,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:07:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:07:25,377 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 11 states. [2021-01-06 16:07:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:07:30,778 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2021-01-06 16:07:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 16:07:30,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2021-01-06 16:07:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:07:30,784 INFO L225 Difference]: With dead ends: 207 [2021-01-06 16:07:30,784 INFO L226 Difference]: Without dead ends: 164 [2021-01-06 16:07:30,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2021-01-06 16:07:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-01-06 16:07:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 80. [2021-01-06 16:07:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 16:07:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2021-01-06 16:07:30,802 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 36 [2021-01-06 16:07:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:07:30,803 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2021-01-06 16:07:30,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:07:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2021-01-06 16:07:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:07:30,804 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:07:30,805 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:07:31,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:07:31,019 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:07:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:07:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1907149286, now seen corresponding path program 1 times [2021-01-06 16:07:31,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:07:31,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622237142] [2021-01-06 16:07:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:07:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-01-06 16:07:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-01-06 16:07:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 16:07:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-06 16:07:31,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622237142] [2021-01-06 16:07:31,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304802923] [2021-01-06 16:07:31,355 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-06 16:07:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:07:31,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 51 conjunts are in the unsatisfiable core [2021-01-06 16:07:31,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:07:31,533 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-06 16:07:31,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,555 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:31,559 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,559 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-01-06 16:07:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:31,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:31,609 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-01-06 16:07:31,611 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:31,630 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-01-06 16:07:31,759 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:31,759 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-06 16:07:31,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:31,765 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:31,786 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:31,786 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2021-01-06 16:07:31,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 16:07:32,092 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-01-06 16:07:32,094 INFO L348 Elim1Store]: treesize reduction 28, result has 87.0 percent of original size [2021-01-06 16:07:32,094 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 214 [2021-01-06 16:07:32,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 3, 2, 1] term [2021-01-06 16:07:32,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-06 16:07:32,120 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:32,194 INFO L625 ElimStorePlain]: treesize reduction 58, result has 57.7 percent of original size [2021-01-06 16:07:32,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:32,209 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 16:07:32,210 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:106 [2021-01-06 16:07:32,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:32,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:32,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:32,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:32,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:32,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 16:07:35,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2021-01-06 16:07:35,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:37,759 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 68 [2021-01-06 16:07:37,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:37,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:37,878 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 9 treesize of output 3 [2021-01-06 16:07:37,880 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:37,890 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 9 treesize of output 3 [2021-01-06 16:07:37,892 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:38,370 WARN L197 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2021-01-06 16:07:38,372 INFO L625 ElimStorePlain]: treesize reduction 56, result has 91.5 percent of original size [2021-01-06 16:07:38,381 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 9 treesize of output 3 [2021-01-06 16:07:38,383 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:38,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 9 treesize of output 3 [2021-01-06 16:07:38,394 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:38,617 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-06 16:07:38,618 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:38,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2021-01-06 16:07:38,627 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:677, output treesize:585 [2021-01-06 16:07:38,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:38,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:38,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:38,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:38,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:38,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:07:47,703 WARN L197 SmtUtils]: Spent 8.70 s on a formula simplification that was a NOOP. DAG size: 42 [2021-01-06 16:07:47,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-06 16:07:47,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:07:47,826 INFO L443 ElimStorePlain]: Different costs {10=[v_prenex_30], 18=[|#memory_$Pointer$.base|]} [2021-01-06 16:07:47,889 INFO L348 Elim1Store]: treesize reduction 14, result has 79.1 percent of original size [2021-01-06 16:07:47,890 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 84 [2021-01-06 16:07:47,894 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:47,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:48,079 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-06 16:07:48,080 INFO L348 Elim1Store]: treesize reduction 10, result has 91.7 percent of original size [2021-01-06 16:07:48,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 142 [2021-01-06 16:07:48,087 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 16:07:48,088 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 16:07:48,088 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:07:48,089 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 16:07:48,090 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:07:48,092 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 16:07:48,093 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 16:07:48,099 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:07:48,128 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:07:48,132 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:07:48,132 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:171, output treesize:4 [2021-01-06 16:07:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 16:07:48,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:07:48,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 24 [2021-01-06 16:07:48,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856662687] [2021-01-06 16:07:48,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-01-06 16:07:48,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:07:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-01-06 16:07:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=494, Unknown=1, NotChecked=0, Total=552 [2021-01-06 16:07:48,211 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand 24 states. [2021-01-06 16:07:54,224 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2021-01-06 16:08:01,269 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-06 16:08:03,283 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2021-01-06 16:08:19,511 WARN L197 SmtUtils]: Spent 10.21 s on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2021-01-06 16:08:35,672 WARN L197 SmtUtils]: Spent 10.25 s on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-01-06 16:08:45,913 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2021-01-06 16:08:52,443 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2021-01-06 16:08:52,914 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-01-06 16:08:55,113 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-01-06 16:08:55,432 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2021-01-06 16:08:55,946 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-01-06 16:09:06,202 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2021-01-06 16:09:14,453 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2021-01-06 16:09:16,665 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2021-01-06 16:09:16,958 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2021-01-06 16:09:17,198 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2021-01-06 16:09:27,472 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2021-01-06 16:09:35,715 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-01-06 16:09:35,886 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2021-01-06 16:09:38,088 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-01-06 16:09:49,578 WARN L197 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 148 DAG size of output: 74 [2021-01-06 16:09:49,994 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 67 [2021-01-06 16:10:16,752 WARN L197 SmtUtils]: Spent 26.42 s on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2021-01-06 16:10:41,247 WARN L197 SmtUtils]: Spent 24.40 s on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-01-06 16:11:01,835 WARN L197 SmtUtils]: Spent 10.42 s on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2021-01-06 16:11:20,384 WARN L197 SmtUtils]: Spent 10.35 s on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2021-01-06 16:11:55,463 WARN L197 SmtUtils]: Spent 34.75 s on a formula simplification. DAG size of input: 117 DAG size of output: 105