/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 13:36:03,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 13:36:03,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 13:36:03,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 13:36:03,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 13:36:03,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 13:36:03,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 13:36:03,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 13:36:03,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 13:36:03,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 13:36:03,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 13:36:03,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 13:36:03,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 13:36:03,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 13:36:03,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 13:36:03,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 13:36:03,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 13:36:03,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 13:36:03,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 13:36:03,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 13:36:03,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 13:36:03,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 13:36:03,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 13:36:03,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 13:36:03,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 13:36:03,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 13:36:03,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 13:36:03,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 13:36:03,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 13:36:03,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 13:36:03,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 13:36:03,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 13:36:03,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 13:36:03,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 13:36:03,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 13:36:03,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 13:36:03,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 13:36:03,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 13:36:03,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 13:36:03,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 13:36:03,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 13:36:03,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 13:36:03,664 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 13:36:03,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 13:36:03,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 13:36:03,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 13:36:03,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 13:36:03,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 13:36:03,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 13:36:03,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 13:36:03,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 13:36:03,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 13:36:03,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 13:36:03,672 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 13:36:04,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 13:36:04,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 13:36:04,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 13:36:04,117 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 13:36:04,117 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 13:36:04,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2021-05-02 13:36:04,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e012a6763/d5a2b5186b934d7a84fea1add15185c8/FLAG76628a3a6 [2021-05-02 13:36:04,709 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 13:36:04,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2021-05-02 13:36:04,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e012a6763/d5a2b5186b934d7a84fea1add15185c8/FLAG76628a3a6 [2021-05-02 13:36:05,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e012a6763/d5a2b5186b934d7a84fea1add15185c8 [2021-05-02 13:36:05,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 13:36:05,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 13:36:05,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 13:36:05,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 13:36:05,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 13:36:05,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718d6646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05, skipping insertion in model container [2021-05-02 13:36:05,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 13:36:05,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 13:36:05,275 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2021-05-02 13:36:05,286 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-02 13:36:05,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:36:05,309 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 13:36:05,349 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2021-05-02 13:36:05,371 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-02 13:36:05,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 13:36:05,411 INFO L208 MainTranslator]: Completed translation [2021-05-02 13:36:05,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05 WrapperNode [2021-05-02 13:36:05,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 13:36:05,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 13:36:05,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 13:36:05,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 13:36:05,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... [2021-05-02 13:36:05,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 13:36:05,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 13:36:05,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 13:36:05,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 13:36:05,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-05-02 13:36:05,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 13:36:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 13:36:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 13:36:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 13:36:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 13:36:05,566 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-05-02 13:36:05,567 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-05-02 13:36:05,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-05-02 13:36:05,568 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-05-02 13:36:05,568 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-05-02 13:36:05,569 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2021-05-02 13:36:05,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 13:36:05,572 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 13:36:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-02 13:36:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-05-02 13:36:05,574 INFO L130 BoogieDeclarations]: Found specification of procedure task [2021-05-02 13:36:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-02 13:36:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 13:36:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 13:36:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 13:36:05,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 13:36:06,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 13:36:06,207 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 13:36:06,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:36:06 BoogieIcfgContainer [2021-05-02 13:36:06,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 13:36:06,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 13:36:06,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 13:36:06,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 13:36:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 01:36:05" (1/3) ... [2021-05-02 13:36:06,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcb093b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:36:06, skipping insertion in model container [2021-05-02 13:36:06,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 01:36:05" (2/3) ... [2021-05-02 13:36:06,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcb093b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 01:36:06, skipping insertion in model container [2021-05-02 13:36:06,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 01:36:06" (3/3) ... [2021-05-02 13:36:06,223 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2021-05-02 13:36:06,227 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 13:36:06,230 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 13:36:06,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 13:36:06,264 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 13:36:06,265 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 13:36:06,265 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 13:36:06,265 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 13:36:06,265 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 13:36:06,265 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 13:36:06,265 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 13:36:06,265 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 13:36:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-02 13:36:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 13:36:06,286 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:06,287 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:36:06,287 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2021-05-02 13:36:06,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:06,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397419679] [2021-05-02 13:36:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:36:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:36:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 13:36:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 13:36:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 13:36:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-02 13:36:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 13:36:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:36:06,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:06,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397419679] [2021-05-02 13:36:06,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397419679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:36:06,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:36:06,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 13:36:06,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184390757] [2021-05-02 13:36:06,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 13:36:06,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 13:36:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-02 13:36:06,629 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 13:36:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:07,056 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2021-05-02 13:36:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 13:36:07,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2021-05-02 13:36:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:07,068 INFO L225 Difference]: With dead ends: 168 [2021-05-02 13:36:07,068 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 13:36:07,072 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-02 13:36:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 13:36:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2021-05-02 13:36:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2021-05-02 13:36:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2021-05-02 13:36:07,133 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2021-05-02 13:36:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:07,134 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2021-05-02 13:36:07,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-02 13:36:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2021-05-02 13:36:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 13:36:07,143 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:07,143 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:36:07,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 13:36:07,144 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2021-05-02 13:36:07,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:07,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038044564] [2021-05-02 13:36:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:36:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:36:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 13:36:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 13:36:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 13:36:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-02 13:36:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 13:36:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 13:36:07,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:07,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038044564] [2021-05-02 13:36:07,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038044564] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:36:07,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:36:07,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 13:36:07,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703027256] [2021-05-02 13:36:07,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 13:36:07,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 13:36:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-05-02 13:36:07,370 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-02 13:36:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:07,938 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2021-05-02 13:36:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 13:36:07,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2021-05-02 13:36:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:07,940 INFO L225 Difference]: With dead ends: 154 [2021-05-02 13:36:07,940 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 13:36:07,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 196.5ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-05-02 13:36:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 13:36:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2021-05-02 13:36:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2021-05-02 13:36:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2021-05-02 13:36:07,952 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2021-05-02 13:36:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:07,952 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-05-02 13:36:07,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-02 13:36:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2021-05-02 13:36:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 13:36:07,954 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:07,954 INFO L523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:36:07,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 13:36:07,954 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2021-05-02 13:36:07,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:07,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253040490] [2021-05-02 13:36:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:36:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:36:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 13:36:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 13:36:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-02 13:36:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-02 13:36:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-02 13:36:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 13:36:08,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:08,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253040490] [2021-05-02 13:36:08,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253040490] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:36:08,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580233706] [2021-05-02 13:36:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 13:36:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:08,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 25 conjunts are in the unsatisfiable core [2021-05-02 13:36:08,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:36:08,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,659 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 13:36:08,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580233706] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:36:08,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 13:36:08,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 12 [2021-05-02 13:36:08,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389958621] [2021-05-02 13:36:08,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 13:36:08,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 13:36:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-05-02 13:36:08,731 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-05-02 13:36:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:09,346 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2021-05-02 13:36:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 13:36:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 56 [2021-05-02 13:36:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:09,348 INFO L225 Difference]: With dead ends: 164 [2021-05-02 13:36:09,348 INFO L226 Difference]: Without dead ends: 96 [2021-05-02 13:36:09,349 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 350.6ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-05-02 13:36:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-05-02 13:36:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2021-05-02 13:36:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2021-05-02 13:36:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2021-05-02 13:36:09,357 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2021-05-02 13:36:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:09,357 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2021-05-02 13:36:09,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 6 states have internal predecessors, (42), 5 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-05-02 13:36:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2021-05-02 13:36:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-02 13:36:09,358 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:09,359 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05-02 13:36:09,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-05-02 13:36:09,582 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2021-05-02 13:36:09,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:09,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322232767] [2021-05-02 13:36:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:36:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:36:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-02 13:36:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:36:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 13:36:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 13:36:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 13:36:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 13:36:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-05-02 13:36:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-05-02 13:36:09,752 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:09,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322232767] [2021-05-02 13:36:09,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322232767] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:36:09,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 13:36:09,752 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 13:36:09,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853798242] [2021-05-02 13:36:09,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 13:36:09,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 13:36:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-02 13:36:09,753 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-02 13:36:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:10,302 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2021-05-02 13:36:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 13:36:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2021-05-02 13:36:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:10,303 INFO L225 Difference]: With dead ends: 163 [2021-05-02 13:36:10,303 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 13:36:10,304 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 263.9ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:36:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 13:36:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-05-02 13:36:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2021-05-02 13:36:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2021-05-02 13:36:10,313 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2021-05-02 13:36:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:10,313 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2021-05-02 13:36:10,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-02 13:36:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2021-05-02 13:36:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 13:36:10,314 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:10,315 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 13:36:10,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 13:36:10,315 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2021-05-02 13:36:10,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:10,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062546780] [2021-05-02 13:36:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 13:36:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-02 13:36:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-02 13:36:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-02 13:36:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 13:36:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-02 13:36:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-02 13:36:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-02 13:36:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-02 13:36:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-05-02 13:36:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 13:36:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-05-02 13:36:10,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 13:36:10,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062546780] [2021-05-02 13:36:10,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062546780] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 13:36:10,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079602905] [2021-05-02 13:36:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-05-02 13:36:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 13:36:10,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-02 13:36:10,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 13:36:10,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,767 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 13:36:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-05-02 13:36:10,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079602905] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 13:36:10,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-05-02 13:36:10,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 21 [2021-05-02 13:36:10,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707473917] [2021-05-02 13:36:10,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 13:36:10,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 13:36:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 13:36:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2021-05-02 13:36:10,795 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2021-05-02 13:36:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 13:36:10,905 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2021-05-02 13:36:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 13:36:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2021-05-02 13:36:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 13:36:10,907 INFO L225 Difference]: With dead ends: 149 [2021-05-02 13:36:10,907 INFO L226 Difference]: Without dead ends: 96 [2021-05-02 13:36:10,908 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 218.9ms TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2021-05-02 13:36:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-05-02 13:36:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-05-02 13:36:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2021-05-02 13:36:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2021-05-02 13:36:10,918 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2021-05-02 13:36:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 13:36:10,918 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2021-05-02 13:36:10,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2021-05-02 13:36:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2021-05-02 13:36:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 13:36:10,919 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 13:36:10,919 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05-02 13:36:11,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 13:36:11,138 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 13:36:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 13:36:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2021-05-02 13:36:11,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 13:36:11,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717259894] [2021-05-02 13:36:11,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 13:36:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:36:11,158 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:36:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-02 13:36:11,174 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-02 13:36:11,194 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-02 13:36:11,194 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-02 13:36:11,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 13:36:11,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 01:36:11 BoogieIcfgContainer [2021-05-02 13:36:11,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 13:36:11,228 INFO L168 Benchmark]: Toolchain (without parser) took 6052.66 ms. Allocated memory was 174.1 MB in the beginning and 252.7 MB in the end (delta: 78.6 MB). Free memory was 138.2 MB in the beginning and 191.1 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:11,228 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 174.1 MB. Free memory is still 155.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 13:36:11,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.10 ms. Allocated memory is still 174.1 MB. Free memory was 137.9 MB in the beginning and 154.6 MB in the end (delta: -16.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:11,228 INFO L168 Benchmark]: Boogie Preprocessor took 69.12 ms. Allocated memory is still 174.1 MB. Free memory was 154.6 MB in the beginning and 152.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:11,228 INFO L168 Benchmark]: RCFGBuilder took 731.67 ms. Allocated memory is still 174.1 MB. Free memory was 152.5 MB in the beginning and 118.4 MB in the end (delta: 34.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:11,228 INFO L168 Benchmark]: TraceAbstraction took 5011.58 ms. Allocated memory was 174.1 MB in the beginning and 252.7 MB in the end (delta: 78.6 MB). Free memory was 117.9 MB in the beginning and 191.1 MB in the end (delta: -73.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 8.0 GB. [2021-05-02 13:36:11,229 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 174.1 MB. Free memory is still 155.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 235.10 ms. Allocated memory is still 174.1 MB. Free memory was 137.9 MB in the beginning and 154.6 MB in the end (delta: -16.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.12 ms. Allocated memory is still 174.1 MB. Free memory was 154.6 MB in the beginning and 152.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 731.67 ms. Allocated memory is still 174.1 MB. Free memory was 152.5 MB in the beginning and 118.4 MB in the end (delta: 34.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5011.58 ms. Allocated memory was 174.1 MB in the beginning and 252.7 MB in the end (delta: 78.6 MB). Free memory was 117.9 MB in the beginning and 191.1 MB in the end (delta: -73.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, malloc(sizeof(struct node))={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) VAL [t={-2:0}] [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={3:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={3:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={3:0}, n=1, t={-2:0}, t={-2:0}] [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4931.4ms, OverallIterations: 6, TraceHistogramMax: 3, EmptinessCheckTime: 23.2ms, AutomataDifference: 2311.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 439 SDtfs, 460 SDslu, 1648 SDs, 0 SdLazy, 1598 SolverSat, 463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1197.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1117.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 88.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 72.6ms SsaConstructionTime, 205.5ms SatisfiabilityAnalysisTime, 1411.8ms InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 1267 SizeOfPredicates, 10 NumberOfNonLiveVariables, 728 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 105/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...