./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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_rec_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 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 12:42:16,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:42:16,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:42:16,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:42:16,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:42:16,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:42:16,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:42:16,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:42:16,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:42:16,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:42:16,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:42:16,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:42:16,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:42:16,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:42:16,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:42:16,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:42:16,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:42:16,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:42:16,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:42:16,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:42:16,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:42:16,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:42:16,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:42:16,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:42:16,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:42:16,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:42:16,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:42:16,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:42:16,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:42:16,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:42:16,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:42:16,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:42:16,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:42:16,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:42:16,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:42:16,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:42:16,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:42:16,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:42:16,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:42:16,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:42:16,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:42:16,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 12:42:16,485 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:42:16,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:42:16,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:42:16,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:42:16,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:42:16,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:42:16,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:42:16,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:42:16,488 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:42:16,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:42:16,488 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:42:16,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:42:16,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:42:16,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:42:16,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 12:42:16,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:42:16,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 12:42:16,489 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:42:16,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 12:42:16,490 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:42:16,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 12:42:16,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:42:16,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:42:16,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:42:16,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:42:16,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:42:16,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:42:16,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 12:42:16,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:42:16,492 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:42:16,493 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 -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2023-02-15 12:42:16,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:42:16,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:42:16,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:42:16,676 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:42:16,676 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:42:16,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-02-15 12:42:17,565 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:42:17,714 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:42:17,714 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2023-02-15 12:42:17,719 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd449241b/42275103f4304c7fbc1a28d96d86124f/FLAG7a7985603 [2023-02-15 12:42:17,728 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd449241b/42275103f4304c7fbc1a28d96d86124f [2023-02-15 12:42:17,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:42:17,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:42:17,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:42:17,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:42:17,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:42:17,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af2366d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17, skipping insertion in model container [2023-02-15 12:42:17,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:42:17,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:42:17,836 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_rec_incorrect.c[618,631] [2023-02-15 12:42:17,844 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-15 12:42:17,845 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-15 12:42:17,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:42:17,861 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:42:17,869 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_rec_incorrect.c[618,631] [2023-02-15 12:42:17,872 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-15 12:42:17,873 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-15 12:42:17,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:42:17,894 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:42:17,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17 WrapperNode [2023-02-15 12:42:17,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:42:17,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:42:17,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:42:17,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:42:17,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,920 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-02-15 12:42:17,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:42:17,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:42:17,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:42:17,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:42:17,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,942 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:42:17,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:42:17,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:42:17,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:42:17,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (1/1) ... [2023-02-15 12:42:17,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:42:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:17,979 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-15 12:42:17,983 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-15 12:42:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:42:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 12:42:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 12:42:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-02-15 12:42:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-02-15 12:42:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 12:42:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-02-15 12:42:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-02-15 12:42:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 12:42:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-15 12:42:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-02-15 12:42:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-02-15 12:42:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-02-15 12:42:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:42:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:42:18,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 12:42:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 12:42:18,011 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-02-15 12:42:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-02-15 12:42:18,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:42:18,101 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:42:18,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:42:18,352 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:42:18,357 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:42:18,358 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 12:42:18,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:18 BoogieIcfgContainer [2023-02-15 12:42:18,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:42:18,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:42:18,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:42:18,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:42:18,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:42:17" (1/3) ... [2023-02-15 12:42:18,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c93fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:18, skipping insertion in model container [2023-02-15 12:42:18,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:17" (2/3) ... [2023-02-15 12:42:18,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c93fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:18, skipping insertion in model container [2023-02-15 12:42:18,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:18" (3/3) ... [2023-02-15 12:42:18,365 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-02-15 12:42:18,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:42:18,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 12:42:18,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:42:18,414 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;@382d0f52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:42:18,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 12:42:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-15 12:42:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:42:18,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:18,425 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-15 12:42:18,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1201346449, now seen corresponding path program 1 times [2023-02-15 12:42:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:18,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609676139] [2023-02-15 12:42:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 12:42:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 12:42:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-15 12:42:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 12:42:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:18,685 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-15 12:42:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609676139] [2023-02-15 12:42:18,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609676139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:18,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:42:18,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 12:42:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604837382] [2023-02-15 12:42:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:18,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:42:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:18,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:42:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:42:18,720 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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-15 12:42:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:18,949 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2023-02-15 12:42:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:42:18,951 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-15 12:42:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:18,960 INFO L225 Difference]: With dead ends: 148 [2023-02-15 12:42:18,960 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 12:42:18,963 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-15 12:42:18,968 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:18,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:42:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 12:42:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2023-02-15 12:42:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-15 12:42:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2023-02-15 12:42:19,016 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 36 [2023-02-15 12:42:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:19,017 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2023-02-15 12:42:19,018 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-15 12:42:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2023-02-15 12:42:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 12:42:19,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:19,021 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-15 12:42:19,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:42:19,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1505272945, now seen corresponding path program 1 times [2023-02-15 12:42:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:19,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192732633] [2023-02-15 12:42:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 12:42:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 12:42:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-15 12:42:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 12:42:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,282 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-15 12:42:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:19,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192732633] [2023-02-15 12:42:19,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192732633] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:19,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:42:19,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 12:42:19,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98072474] [2023-02-15 12:42:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:19,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:42:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:42:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:42:19,286 INFO L87 Difference]: Start difference. First operand 79 states and 100 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-15 12:42:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:19,512 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2023-02-15 12:42:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:42:19,512 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-15 12:42:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:19,517 INFO L225 Difference]: With dead ends: 142 [2023-02-15 12:42:19,518 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 12:42:19,521 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-15 12:42:19,522 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:19,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 231 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:42:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 12:42:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-15 12:42:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2023-02-15 12:42:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2023-02-15 12:42:19,539 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 36 [2023-02-15 12:42:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:19,539 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2023-02-15 12:42:19,541 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-15 12:42:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2023-02-15 12:42:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 12:42:19,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:19,547 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-15 12:42:19,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:42:19,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1392403970, now seen corresponding path program 1 times [2023-02-15 12:42:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:19,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056209471] [2023-02-15 12:42:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-15 12:42:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 12:42:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:42:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 12:42:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 12:42:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,831 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-15 12:42:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:19,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056209471] [2023-02-15 12:42:19,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056209471] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:19,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689643296] [2023-02-15 12:42:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:19,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:19,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:19,851 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-15 12:42:19,852 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-15 12:42:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:19,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 12:42:19,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:42:20,060 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-15 12:42:20,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:42:20,226 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-15 12:42:20,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689643296] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:42:20,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:42:20,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2023-02-15 12:42:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712514851] [2023-02-15 12:42:20,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:42:20,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 12:42:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 12:42:20,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-15 12:42:20,229 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 12:42:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:20,544 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2023-02-15 12:42:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:42:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 48 [2023-02-15 12:42:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:20,545 INFO L225 Difference]: With dead ends: 148 [2023-02-15 12:42:20,546 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 12:42:20,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-15 12:42:20,547 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:20,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 358 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:42:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 12:42:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-02-15 12:42:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2023-02-15 12:42:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2023-02-15 12:42:20,558 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 48 [2023-02-15 12:42:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:20,558 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2023-02-15 12:42:20,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 12:42:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2023-02-15 12:42:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 12:42:20,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:20,560 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-15 12:42:20,568 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-15 12:42:20,764 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-15 12:42:20,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 164705413, now seen corresponding path program 1 times [2023-02-15 12:42:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389082815] [2023-02-15 12:42:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 12:42:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 12:42:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 12:42:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:42:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-15 12:42:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-15 12:42:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,018 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-15 12:42:21,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:21,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389082815] [2023-02-15 12:42:21,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389082815] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:21,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:42:21,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 12:42:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943159576] [2023-02-15 12:42:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:21,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 12:42:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 12:42:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-15 12:42:21,020 INFO L87 Difference]: Start difference. First operand 83 states and 107 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-15 12:42:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:21,312 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2023-02-15 12:42:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:42:21,312 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-15 12:42:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:21,313 INFO L225 Difference]: With dead ends: 148 [2023-02-15 12:42:21,313 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 12:42:21,313 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-15 12:42:21,314 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 73 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:21,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 334 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 12:42:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 12:42:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2023-02-15 12:42:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2023-02-15 12:42:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2023-02-15 12:42:21,321 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 58 [2023-02-15 12:42:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:21,321 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2023-02-15 12:42:21,321 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-15 12:42:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2023-02-15 12:42:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 12:42:21,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:21,322 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-15 12:42:21,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 12:42:21,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 159940150, now seen corresponding path program 1 times [2023-02-15 12:42:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350738933] [2023-02-15 12:42:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 12:42:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 12:42:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 12:42:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:42:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 12:42:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 12:42:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-15 12:42:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-15 12:42:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-15 12:42:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,628 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-15 12:42:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:42:21,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350738933] [2023-02-15 12:42:21,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350738933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:42:21,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560316706] [2023-02-15 12:42:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:21,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:42:21,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:42:21,630 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-15 12:42:21,664 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-15 12:42:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:42:21,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 12:42:21,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:42:21,797 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-15 12:42:21,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 12:42:21,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560316706] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:42:21,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 12:42:21,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-02-15 12:42:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432993215] [2023-02-15 12:42:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:42:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:42:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:42:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:42:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-02-15 12:42:21,799 INFO L87 Difference]: Start difference. First operand 85 states and 110 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-15 12:42:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:42:21,889 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2023-02-15 12:42:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:42:21,889 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-15 12:42:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:42:21,890 INFO L225 Difference]: With dead ends: 139 [2023-02-15 12:42:21,890 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 12:42:21,891 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-15 12:42:21,891 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:42:21,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 534 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 12:42:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 12:42:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 12:42:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2023-02-15 12:42:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2023-02-15 12:42:21,919 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 71 [2023-02-15 12:42:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:42:21,919 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2023-02-15 12:42:21,919 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-15 12:42:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2023-02-15 12:42:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-02-15 12:42:21,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:42:21,920 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-15 12:42:21,951 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-15 12:42:22,120 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-15 12:42:22,121 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 12:42:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:42:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 661772809, now seen corresponding path program 1 times [2023-02-15 12:42:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:42:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843258126] [2023-02-15 12:42:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:42:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:42:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:42:22,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 12:42:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 12:42:22,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 12:42:22,221 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 12:42:22,222 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 12:42:22,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 12:42:22,226 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-15 12:42:22,231 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 12:42:22,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:42:22 BoogieIcfgContainer [2023-02-15 12:42:22,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 12:42:22,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 12:42:22,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 12:42:22,281 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 12:42:22,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:18" (3/4) ... [2023-02-15 12:42:22,283 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 12:42:22,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 12:42:22,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 12:42:22,334 INFO L158 Benchmark]: Toolchain (without parser) took 4603.31ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 120.2MB in the beginning and 165.0MB in the end (delta: -44.8MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,334 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:42:22,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.37ms. Allocated memory is still 157.3MB. Free memory was 120.2MB in the beginning and 108.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.18ms. Allocated memory is still 157.3MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,335 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 157.3MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,335 INFO L158 Benchmark]: RCFGBuilder took 413.12ms. Allocated memory is still 157.3MB. Free memory was 104.0MB in the beginning and 84.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,335 INFO L158 Benchmark]: TraceAbstraction took 3919.52ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 83.8MB in the beginning and 169.2MB in the end (delta: -85.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 12:42:22,336 INFO L158 Benchmark]: Witness Printer took 53.04ms. Allocated memory is still 224.4MB. Free memory was 169.2MB in the beginning and 165.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 12:42:22,337 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.14ms. Allocated memory is still 157.3MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.37ms. Allocated memory is still 157.3MB. Free memory was 120.2MB in the beginning and 108.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.18ms. Allocated memory is still 157.3MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 157.3MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.12ms. Allocated memory is still 157.3MB. Free memory was 104.0MB in the beginning and 84.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3919.52ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 83.8MB in the beginning and 169.2MB in the end (delta: -85.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.04ms. Allocated memory is still 224.4MB. Free memory was 169.2MB in the beginning and 165.0MB 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: [L98] 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}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L98] CALL task(nondet_tree()) [L76] 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}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L79] CALL, EXPR size(t) VAL [t={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] 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}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] 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}] [L81] 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}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] 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}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L82] 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}] [L83] 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] [L83] 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 8 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 1570 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 334 mSDtfsCounter, 1381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 1167 SizeOfPredicates, 12 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-15 12:42:22,360 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