./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 11:44:42,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 11:44:42,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 11:44:42,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 11:44:42,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 11:44:42,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 11:44:42,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 11:44:42,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 11:44:42,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 11:44:42,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 11:44:42,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 11:44:42,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 11:44:42,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 11:44:42,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 11:44:42,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 11:44:42,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 11:44:42,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 11:44:42,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 11:44:42,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 11:44:42,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 11:44:42,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 11:44:42,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 11:44:42,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 11:44:42,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 11:44:42,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 11:44:42,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 11:44:42,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 11:44:42,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 11:44:42,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 11:44:42,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 11:44:42,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 11:44:42,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 11:44:42,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 11:44:42,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 11:44:42,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 11:44:42,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 11:44:42,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 11:44:42,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 11:44:42,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 11:44:42,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 11:44:42,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 11:44:42,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 11:44:42,187 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 11:44:42,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 11:44:42,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 11:44:42,187 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 11:44:42,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 11:44:42,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 11:44:42,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 11:44:42,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 11:44:42,189 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 11:44:42,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 11:44:42,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 11:44:42,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 11:44:42,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:44:42,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 11:44:42,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 11:44:42,193 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 11:44:42,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 11:44:42,193 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 11:44:42,193 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2023-02-14 11:44:42,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 11:44:42,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 11:44:42,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 11:44:42,406 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 11:44:42,407 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 11:44:42,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2023-02-14 11:44:43,272 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 11:44:43,465 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 11:44:43,466 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2023-02-14 11:44:43,470 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0849ef108/f4911949835f41f48fb016556b7da7d3/FLAG8eae39742 [2023-02-14 11:44:43,479 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0849ef108/f4911949835f41f48fb016556b7da7d3 [2023-02-14 11:44:43,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 11:44:43,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 11:44:43,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 11:44:43,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 11:44:43,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 11:44:43,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49be553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43, skipping insertion in model container [2023-02-14 11:44:43,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 11:44:43,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 11:44:43,649 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2023-02-14 11:44:43,673 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-14 11:44:43,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:44:43,701 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 11:44:43,712 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2023-02-14 11:44:43,727 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-14 11:44:43,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:44:43,754 INFO L208 MainTranslator]: Completed translation [2023-02-14 11:44:43,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43 WrapperNode [2023-02-14 11:44:43,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 11:44:43,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 11:44:43,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 11:44:43,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 11:44:43,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,796 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2023-02-14 11:44:43,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 11:44:43,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 11:44:43,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 11:44:43,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 11:44:43,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,839 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 11:44:43,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 11:44:43,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 11:44:43,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 11:44:43,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (1/1) ... [2023-02-14 11:44:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:44:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:44:43,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 11:44:43,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 11:44:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 11:44:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 11:44:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 11:44:43,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 11:44:43,916 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-02-14 11:44:43,916 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-02-14 11:44:43,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 11:44:43,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-14 11:44:43,916 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-14 11:44:43,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 11:44:43,916 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-02-14 11:44:43,916 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-02-14 11:44:43,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 11:44:43,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 11:44:43,917 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-02-14 11:44:43,917 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-02-14 11:44:43,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 11:44:43,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 11:44:43,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-14 11:44:43,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-14 11:44:43,918 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-02-14 11:44:43,918 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-02-14 11:44:43,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 11:44:44,012 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 11:44:44,014 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 11:44:44,217 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 11:44:44,221 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 11:44:44,221 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 11:44:44,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:44:44 BoogieIcfgContainer [2023-02-14 11:44:44,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 11:44:44,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 11:44:44,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 11:44:44,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 11:44:44,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 11:44:43" (1/3) ... [2023-02-14 11:44:44,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e5ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:44:44, skipping insertion in model container [2023-02-14 11:44:44,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:44:43" (2/3) ... [2023-02-14 11:44:44,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e5ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:44:44, skipping insertion in model container [2023-02-14 11:44:44,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:44:44" (3/3) ... [2023-02-14 11:44:44,228 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2023-02-14 11:44:44,239 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 11:44:44,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 11:44:44,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 11:44:44,273 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18586147, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 11:44:44,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 11:44:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-14 11:44:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 11:44:44,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:44,284 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:44,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -858928279, now seen corresponding path program 1 times [2023-02-14 11:44:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:44,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848928556] [2023-02-14 11:44:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-14 11:44:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 11:44:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-14 11:44:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-14 11:44:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:44:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:44:44,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848928556] [2023-02-14 11:44:44,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848928556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:44:44,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:44:44,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 11:44:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956551317] [2023-02-14 11:44:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:44:44,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 11:44:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:44:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 11:44:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:44:44,618 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 11:44:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:44:44,836 INFO L93 Difference]: Finished difference Result 142 states and 192 transitions. [2023-02-14 11:44:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:44:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2023-02-14 11:44:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:44:44,846 INFO L225 Difference]: With dead ends: 142 [2023-02-14 11:44:44,847 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 11:44:44,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:44:44,855 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:44:44,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 120 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:44:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 11:44:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-14 11:44:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-14 11:44:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2023-02-14 11:44:44,895 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2023-02-14 11:44:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:44:44,896 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2023-02-14 11:44:44,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 11:44:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2023-02-14 11:44:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 11:44:44,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:44,898 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:44,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 11:44:44,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1847691115, now seen corresponding path program 1 times [2023-02-14 11:44:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458022910] [2023-02-14 11:44:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-14 11:44:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 11:44:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-14 11:44:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-14 11:44:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:44:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:44:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458022910] [2023-02-14 11:44:45,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458022910] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:44:45,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:44:45,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 11:44:45,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292741589] [2023-02-14 11:44:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:44:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 11:44:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:44:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 11:44:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 11:44:45,159 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 11:44:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:44:45,357 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2023-02-14 11:44:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 11:44:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2023-02-14 11:44:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:44:45,361 INFO L225 Difference]: With dead ends: 136 [2023-02-14 11:44:45,361 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 11:44:45,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-14 11:44:45,365 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:44:45,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 224 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:44:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 11:44:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-14 11:44:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-14 11:44:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2023-02-14 11:44:45,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 36 [2023-02-14 11:44:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:44:45,385 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2023-02-14 11:44:45,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 11:44:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2023-02-14 11:44:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 11:44:45,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:45,392 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 11:44:45,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 289307572, now seen corresponding path program 1 times [2023-02-14 11:44:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:45,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251813558] [2023-02-14 11:44:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-14 11:44:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-14 11:44:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-14 11:44:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-14 11:44:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-14 11:44:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 11:44:45,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:44:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251813558] [2023-02-14 11:44:45,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251813558] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:44:45,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354255641] [2023-02-14 11:44:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:44:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:44:45,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:44:45,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 11:44:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:45,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 11:44:45,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:44:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 11:44:45,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:44:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 11:44:46,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354255641] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:44:46,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:44:46,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-02-14 11:44:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565589420] [2023-02-14 11:44:46,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:44:46,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 11:44:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:44:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 11:44:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-14 11:44:46,074 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-14 11:44:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:44:46,394 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2023-02-14 11:44:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 11:44:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2023-02-14 11:44:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:44:46,395 INFO L225 Difference]: With dead ends: 142 [2023-02-14 11:44:46,395 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 11:44:46,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-02-14 11:44:46,397 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:44:46,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 372 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:44:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 11:44:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-02-14 11:44:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2023-02-14 11:44:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-02-14 11:44:46,403 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 48 [2023-02-14 11:44:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:44:46,404 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-02-14 11:44:46,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-14 11:44:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-02-14 11:44:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 11:44:46,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:46,405 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:46,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 11:44:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:44:46,610 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1954582857, now seen corresponding path program 1 times [2023-02-14 11:44:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:46,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641322506] [2023-02-14 11:44:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-14 11:44:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-14 11:44:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-14 11:44:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-14 11:44:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-14 11:44:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-14 11:44:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-14 11:44:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-14 11:44:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:44:46,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641322506] [2023-02-14 11:44:46,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641322506] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:44:46,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:44:46,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 11:44:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801766682] [2023-02-14 11:44:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:44:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 11:44:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:44:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 11:44:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-14 11:44:46,811 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-14 11:44:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:44:47,060 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2023-02-14 11:44:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 11:44:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-02-14 11:44:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:44:47,061 INFO L225 Difference]: With dead ends: 142 [2023-02-14 11:44:47,061 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 11:44:47,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-14 11:44:47,063 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:44:47,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 324 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:44:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 11:44:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-02-14 11:44:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2023-02-14 11:44:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-02-14 11:44:47,070 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 58 [2023-02-14 11:44:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:44:47,070 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-02-14 11:44:47,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-14 11:44:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-02-14 11:44:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-14 11:44:47,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:47,071 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 11:44:47,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1575743044, now seen corresponding path program 1 times [2023-02-14 11:44:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:47,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295255703] [2023-02-14 11:44:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-14 11:44:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-14 11:44:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-14 11:44:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-14 11:44:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-14 11:44:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 11:44:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-14 11:44:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-14 11:44:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-14 11:44:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-14 11:44:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:44:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295255703] [2023-02-14 11:44:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295255703] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:44:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405292927] [2023-02-14 11:44:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:47,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:44:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:44:47,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:44:47,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 11:44:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:44:47,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 11:44:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:44:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-14 11:44:47,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 11:44:47,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405292927] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:44:47,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 11:44:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-02-14 11:44:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891165590] [2023-02-14 11:44:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:44:47,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 11:44:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:44:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 11:44:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-02-14 11:44:47,563 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 11:44:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:44:47,644 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2023-02-14 11:44:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 11:44:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2023-02-14 11:44:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:44:47,646 INFO L225 Difference]: With dead ends: 133 [2023-02-14 11:44:47,646 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 11:44:47,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-02-14 11:44:47,647 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:44:47,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 508 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:44:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 11:44:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-14 11:44:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2023-02-14 11:44:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2023-02-14 11:44:47,653 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 71 [2023-02-14 11:44:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:44:47,653 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2023-02-14 11:44:47,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 11:44:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2023-02-14 11:44:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-02-14 11:44:47,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:44:47,654 INFO L195 NwaCegarLoop]: 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] [2023-02-14 11:44:47,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 11:44:47,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:44:47,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:44:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:44:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1969188871, now seen corresponding path program 1 times [2023-02-14 11:44:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:44:47,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660272945] [2023-02-14 11:44:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:44:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:44:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 11:44:47,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 11:44:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 11:44:47,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 11:44:47,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 11:44:47,954 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 11:44:47,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 11:44:47,959 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-14 11:44:47,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 11:44:48,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 11:44:48 BoogieIcfgContainer [2023-02-14 11:44:48,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 11:44:48,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 11:44:48,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 11:44:48,009 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 11:44:48,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:44:44" (3/4) ... [2023-02-14 11:44:48,010 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 11:44:48,055 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 11:44:48,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 11:44:48,056 INFO L158 Benchmark]: Toolchain (without parser) took 4574.43ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 125.3MB in the beginning and 79.7MB in the end (delta: 45.6MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,056 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 11:44:48,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.20ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 113.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.24ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,057 INFO L158 Benchmark]: Boogie Preprocessor took 49.46ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 109.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,057 INFO L158 Benchmark]: RCFGBuilder took 375.40ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 88.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,057 INFO L158 Benchmark]: TraceAbstraction took 3784.06ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 87.5MB in the beginning and 83.9MB in the end (delta: 3.7MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,058 INFO L158 Benchmark]: Witness Printer took 47.07ms. Allocated memory is still 186.6MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-14 11:44:48,059 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.13ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.20ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 113.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.24ms. Allocated memory is still 155.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.46ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 109.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.40ms. Allocated memory is still 155.2MB. Free memory was 108.8MB in the beginning and 88.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3784.06ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 87.5MB in the beginning and 83.9MB in the end (delta: 3.7MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * Witness Printer took 47.07ms. Allocated memory is still 186.6MB. Free memory was 83.9MB in the beginning and 79.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 [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 [n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) [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={5: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={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5: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={5: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={5: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={5: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 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 1548 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1215 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1212 IncrementalHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 333 mSDtfsCounter, 1212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 10 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 115/123 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! [2023-02-14 11:44:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE