./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0158-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71b5f65f2f8d87850f90a0c5b95ff806d4054a596ed67d86f7cc490935279607 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:51,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:51,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:51,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:51,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:51,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:51,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:51,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:51,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:51,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:51,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:51,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:51,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:51,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:51,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:51,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:51,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:51,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:51,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:51,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:51,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:51,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:51,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:51,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:51,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:51,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:51,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:51,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:51,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:51,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:51,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:51,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:51,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:51,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:51,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:51,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:51,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:51,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:51,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:51,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:51,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:51,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:44:51,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:51,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:51,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:51,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:51,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:51,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:51,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:51,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:51,609 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:51,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:51,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:51,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:51,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:51,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:51,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:51,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:51,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:51,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:51,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:51,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 71b5f65f2f8d87850f90a0c5b95ff806d4054a596ed67d86f7cc490935279607 [2022-02-20 23:44:51,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:51,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:51,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:51,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:51,851 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:51,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-2.i [2022-02-20 23:44:51,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aab0c09/3851b6fdc503423bbf071a3b807f178f/FLAG222a28497 [2022-02-20 23:44:52,297 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:52,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-2.i [2022-02-20 23:44:52,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aab0c09/3851b6fdc503423bbf071a3b807f178f/FLAG222a28497 [2022-02-20 23:44:52,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aab0c09/3851b6fdc503423bbf071a3b807f178f [2022-02-20 23:44:52,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:52,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:52,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:52,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:52,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:52,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c8a4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52, skipping insertion in model container [2022-02-20 23:44:52,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:52,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:52,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:52,882 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:52,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:52,942 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:52,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52 WrapperNode [2022-02-20 23:44:52,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:52,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:52,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:52,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:52,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,979 INFO L137 Inliner]: procedures = 123, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-20 23:44:52,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:52,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:52,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:52,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:52,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:52,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:53,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:53,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:53,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:53,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:53,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (1/1) ... [2022-02-20 23:44:53,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:53,040 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) [2022-02-20 23:44:53,046 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 [2022-02-20 23:44:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:53,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:53,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:53,171 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:53,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:53,337 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:53,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:53,342 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:53,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:53 BoogieIcfgContainer [2022-02-20 23:44:53,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:53,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:53,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:53,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:53,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:52" (1/3) ... [2022-02-20 23:44:53,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115a8174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:53, skipping insertion in model container [2022-02-20 23:44:53,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:52" (2/3) ... [2022-02-20 23:44:53,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115a8174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:53, skipping insertion in model container [2022-02-20 23:44:53,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:53" (3/3) ... [2022-02-20 23:44:53,360 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158-2.i [2022-02-20 23:44:53,364 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:53,368 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 23:44:53,400 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:53,407 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:53,407 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 23:44:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:53,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:53,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:53,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:53,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:53,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256919] [2022-02-20 23:44:53,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:53,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {20#true} is VALID [2022-02-20 23:44:53,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {22#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {21#false} is VALID [2022-02-20 23:44:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:53,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:53,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256919] [2022-02-20 23:44:53,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:53,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:53,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:53,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736737939] [2022-02-20 23:44:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:53,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:53,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:53,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:53,649 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,699 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-20 23:44:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:53,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:53,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 23:44:53,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,732 INFO L225 Difference]: With dead ends: 14 [2022-02-20 23:44:53,732 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 23:44:53,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:53,738 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:53,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 7 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 23:44:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 23:44:53,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:53,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,782 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,782 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,785 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:53,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 23:44:53,786 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 23:44:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,790 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:53,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:53,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-20 23:44:53,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 3 [2022-02-20 23:44:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:53,793 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-20 23:44:53,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:53,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:53,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:53,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:53,795 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:53,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:53,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486561173] [2022-02-20 23:44:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:53,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {75#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {75#true} is VALID [2022-02-20 23:44:53,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {75#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {77#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:53,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {77#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !(4 + main_~#data~0#1.offset <= #length[main_~#data~0#1.base] && 0 <= main_~#data~0#1.offset); {76#false} is VALID [2022-02-20 23:44:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:53,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:53,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486561173] [2022-02-20 23:44:53,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486561173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:53,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:53,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:53,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268235464] [2022-02-20 23:44:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:53,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:53,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:53,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:53,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:53,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:53,896 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,923 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 23:44:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 23:44:53,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-20 23:44:53,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,938 INFO L225 Difference]: With dead ends: 9 [2022-02-20 23:44:53,938 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 23:44:53,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:53,943 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:53,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 23:44:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 23:44:53,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:53,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,946 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,947 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,947 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:53,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 23:44:53,948 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 23:44:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,950 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:53,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:53,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2022-02-20 23:44:53,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 3 [2022-02-20 23:44:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:53,956 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2022-02-20 23:44:53,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:53,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:53,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:53,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:53,957 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 59200043, now seen corresponding path program 1 times [2022-02-20 23:44:53,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:53,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622877945] [2022-02-20 23:44:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:54,004 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:54,029 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:44:54,029 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:54,030 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2022-02-20 23:44:54,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (5 of 7 remaining) [2022-02-20 23:44:54,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (4 of 7 remaining) [2022-02-20 23:44:54,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (3 of 7 remaining) [2022-02-20 23:44:54,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (2 of 7 remaining) [2022-02-20 23:44:54,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (1 of 7 remaining) [2022-02-20 23:44:54,032 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (0 of 7 remaining) [2022-02-20 23:44:54,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:54,034 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:44:54,036 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:54,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:54 BoogieIcfgContainer [2022-02-20 23:44:54,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:54,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:54,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:54,060 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:54,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:53" (3/4) ... [2022-02-20 23:44:54,062 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:54,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:54,063 INFO L158 Benchmark]: Toolchain (without parser) took 1413.87ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 70.6MB in the end (delta: 12.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-02-20 23:44:54,064 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:54,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.78ms. Allocated memory is still 115.3MB. Free memory was 82.4MB in the beginning and 83.9MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:44:54,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.46ms. Allocated memory is still 115.3MB. Free memory was 83.7MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:54,064 INFO L158 Benchmark]: Boogie Preprocessor took 19.54ms. Allocated memory is still 115.3MB. Free memory was 82.0MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:54,065 INFO L158 Benchmark]: RCFGBuilder took 341.76ms. Allocated memory is still 115.3MB. Free memory was 80.4MB in the beginning and 69.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:44:54,065 INFO L158 Benchmark]: TraceAbstraction took 715.79ms. Allocated memory is still 115.3MB. Free memory was 68.6MB in the beginning and 71.0MB in the end (delta: -2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:54,065 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 115.3MB. Free memory was 71.0MB in the beginning and 70.6MB in the end (delta: 353.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:54,066 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.78ms. Allocated memory is still 115.3MB. Free memory was 82.4MB in the beginning and 83.9MB in the end (delta: -1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.46ms. Allocated memory is still 115.3MB. Free memory was 83.7MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.54ms. Allocated memory is still 115.3MB. Free memory was 82.0MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.76ms. Allocated memory is still 115.3MB. Free memory was 80.4MB in the beginning and 69.2MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 715.79ms. Allocated memory is still 115.3MB. Free memory was 68.6MB in the beginning and 71.0MB in the end (delta: -2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 115.3MB. Free memory was 71.0MB in the beginning and 70.6MB in the end (delta: 353.3kB). There was no memory consumed. 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 - UnprovableResult [Line: 523]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 523. Possible FailurePath: [L525-L532] union { void *p0; struct { char c[2]; void *p1; void *p2; } str; } data; [L533] data.p0 = malloc(37U) VAL [data={3:0}, malloc(37U)={-1:0}] [L534] data.str.p2 = &data VAL [data={3:0}] [L535] data.str.c[1] = sizeof data.str.p1 VAL [data={3:0}] [L536] return 0; [L536] return 0; VAL [\result=0] - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 10 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:54,105 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0158-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71b5f65f2f8d87850f90a0c5b95ff806d4054a596ed67d86f7cc490935279607 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:55,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:55,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:56,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:56,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:56,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:56,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:56,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:56,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:56,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:56,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:56,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:56,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:56,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:56,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:56,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:56,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:56,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:56,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:56,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:56,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:56,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:56,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:56,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:56,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:56,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:56,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:56,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:56,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:56,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:56,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:56,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:56,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:56,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:56,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:56,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:56,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:56,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:56,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:56,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:56,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:56,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:44:56,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:56,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:56,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:56,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:56,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:56,087 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:56,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:56,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:56,088 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:56,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:56,089 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:44:56,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:56,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:56,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:56,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:56,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:56,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:56,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:56,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:56,092 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:44:56,092 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:44:56,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:44:56,092 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 71b5f65f2f8d87850f90a0c5b95ff806d4054a596ed67d86f7cc490935279607 [2022-02-20 23:44:56,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:56,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:56,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:56,367 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:56,367 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:56,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-2.i [2022-02-20 23:44:56,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80b8f2ab/c58ffbb594ff423e804b201bfde6a2b9/FLAG064d68236 [2022-02-20 23:44:56,813 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:56,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-2.i [2022-02-20 23:44:56,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80b8f2ab/c58ffbb594ff423e804b201bfde6a2b9/FLAG064d68236 [2022-02-20 23:44:56,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80b8f2ab/c58ffbb594ff423e804b201bfde6a2b9 [2022-02-20 23:44:56,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:56,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:56,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:56,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:56,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:56,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:56" (1/1) ... [2022-02-20 23:44:56,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1886f942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:56, skipping insertion in model container [2022-02-20 23:44:56,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:56" (1/1) ... [2022-02-20 23:44:56,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:56,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:57,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:57,160 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:57,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:57,232 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:57,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57 WrapperNode [2022-02-20 23:44:57,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:57,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:57,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:57,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:57,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,285 INFO L137 Inliner]: procedures = 124, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2022-02-20 23:44:57,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:57,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:57,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:57,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:57,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:57,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:57,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:57,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:57,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (1/1) ... [2022-02-20 23:44:57,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:57,339 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) [2022-02-20 23:44:57,351 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 [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-20 23:44:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:44:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:57,429 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:57,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:57,548 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:57,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:57,555 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:57,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:57 BoogieIcfgContainer [2022-02-20 23:44:57,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:57,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:57,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:57,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:57,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:56" (1/3) ... [2022-02-20 23:44:57,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97aae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:57, skipping insertion in model container [2022-02-20 23:44:57,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:57" (2/3) ... [2022-02-20 23:44:57,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97aae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:57, skipping insertion in model container [2022-02-20 23:44:57,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:57" (3/3) ... [2022-02-20 23:44:57,561 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158-2.i [2022-02-20 23:44:57,564 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:57,567 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 23:44:57,605 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:57,610 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:57,611 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 23:44:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:57,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:57,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:57,628 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:57,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:57,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119352881] [2022-02-20 23:44:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:57,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:57,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:44:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:44:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:57,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:57,826 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:44:57,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:44:57,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {20#true} is VALID [2022-02-20 23:44:57,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10bv32);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37bv32); {28#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:44:57,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[main_~#data~0#1.base]); {21#false} is VALID [2022-02-20 23:44:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:57,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:57,877 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:57,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119352881] [2022-02-20 23:44:57,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119352881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:57,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:57,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:57,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712513334] [2022-02-20 23:44:57,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:57,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:57,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:57,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:57,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:57,919 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:57,994 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-20 23:44:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:57,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 23:44:58,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:58,031 INFO L225 Difference]: With dead ends: 14 [2022-02-20 23:44:58,032 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 23:44:58,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:58,036 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:58,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 7 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 23:44:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 23:44:58,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:58,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,054 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,054 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:58,057 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:58,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:58,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:58,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 23:44:58,059 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 23:44:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:58,065 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:58,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:58,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:58,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:58,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-20 23:44:58,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 3 [2022-02-20 23:44:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:58,071 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-20 23:44:58,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:58,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:58,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:58,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:58,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:58,281 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:58,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:58,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028702226] [2022-02-20 23:44:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:58,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:58,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:58,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:58,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:44:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:58,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:44:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:58,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:58,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:58,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:44:58,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 23:44:58,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {81#true} is VALID [2022-02-20 23:44:58,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10bv32);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37bv32); {89#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (_ bv10 32) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:58,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {89#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= (_ bv10 32) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~#data~0#1.offset), #length[main_~#data~0#1.base]) && ~bvule32(main_~#data~0#1.offset, ~bvadd32(4bv32, main_~#data~0#1.offset))) && ~bvule32(0bv32, main_~#data~0#1.offset)); {82#false} is VALID [2022-02-20 23:44:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:58,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:58,424 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:58,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028702226] [2022-02-20 23:44:58,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028702226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:58,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:58,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:58,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544070396] [2022-02-20 23:44:58,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:58,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:58,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:58,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:58,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:58,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:58,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:58,431 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:58,469 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 23:44:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-20 23:44:58,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-20 23:44:58,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:58,487 INFO L225 Difference]: With dead ends: 9 [2022-02-20 23:44:58,487 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 23:44:58,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:58,489 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:58,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 23:44:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 23:44:58,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:58,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,491 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,491 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:58,492 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:58,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:58,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:58,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 23:44:58,492 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 23:44:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:58,493 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-02-20 23:44:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:58,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:58,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:58,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:58,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2022-02-20 23:44:58,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 3 [2022-02-20 23:44:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:58,495 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2022-02-20 23:44:58,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-02-20 23:44:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:58,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:58,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:58,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:44:58,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:58,703 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 3 more)] === [2022-02-20 23:44:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash 59200043, now seen corresponding path program 1 times [2022-02-20 23:44:58,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:58,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095516583] [2022-02-20 23:44:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:58,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:58,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:44:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:58,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:58,822 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:44:58,822 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:58,823 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2022-02-20 23:44:58,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (5 of 7 remaining) [2022-02-20 23:44:58,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (4 of 7 remaining) [2022-02-20 23:44:58,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (3 of 7 remaining) [2022-02-20 23:44:58,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (2 of 7 remaining) [2022-02-20 23:44:58,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (1 of 7 remaining) [2022-02-20 23:44:58,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (0 of 7 remaining) [2022-02-20 23:44:58,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:59,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:59,027 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:44:59,029 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:59,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:59 BoogieIcfgContainer [2022-02-20 23:44:59,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:59,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:59,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:59,048 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:59,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:57" (3/4) ... [2022-02-20 23:44:59,050 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:59,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:59,054 INFO L158 Benchmark]: Toolchain (without parser) took 2195.80ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.2MB in the beginning and 29.8MB in the end (delta: -1.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:59,057 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:59,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.56ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.1MB in the beginning and 40.6MB in the end (delta: -12.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-20 23:44:59,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:44:59,058 INFO L158 Benchmark]: Boogie Preprocessor took 28.24ms. Allocated memory is still 65.0MB. Free memory was 38.7MB in the beginning and 37.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:59,058 INFO L158 Benchmark]: RCFGBuilder took 240.97ms. Allocated memory is still 65.0MB. Free memory was 37.2MB in the beginning and 42.9MB in the end (delta: -5.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-20 23:44:59,059 INFO L158 Benchmark]: TraceAbstraction took 1490.17ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 30.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-02-20 23:44:59,062 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 65.0MB. Free memory was 30.2MB in the beginning and 29.8MB in the end (delta: 379.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:59,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.56ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.1MB in the beginning and 40.6MB in the end (delta: -12.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 38.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.24ms. Allocated memory is still 65.0MB. Free memory was 38.7MB in the beginning and 37.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 240.97ms. Allocated memory is still 65.0MB. Free memory was 37.2MB in the beginning and 42.9MB in the end (delta: -5.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1490.17ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 30.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 65.0MB. Free memory was 30.2MB in the beginning and 29.8MB in the end (delta: 379.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 523]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 523. Possible FailurePath: [L525-L532] union { void *p0; struct { char c[2]; void *p1; void *p2; } str; } data; [L533] data.p0 = malloc(37U) VAL [data={13:0}, malloc(37U)={3:0}] [L534] data.str.p2 = &data VAL [data={13:0}] [L535] data.str.c[1] = sizeof data.str.p1 VAL [data={13:0}] [L536] return 0; [L536] return 0; VAL [\result=0] - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 10 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 2 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:59,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample