./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/SyntaxSupportPointer01-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 32689ae30ae51ecba7c5b43dcb93819b27d0e14fbdff3ab2701407818eca0145 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:03:36,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:03:36,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:03:36,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:03:36,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:03:36,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:03:36,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:03:36,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:03:36,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:03:36,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:03:36,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:03:36,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:03:36,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:03:36,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:03:36,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:03:36,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:03:36,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:03:36,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:03:36,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:03:36,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:03:36,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:03:36,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:03:36,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:03:36,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:03:36,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:03:36,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:03:36,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:03:36,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:03:36,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:03:36,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:03:36,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:03:36,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:03:36,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:03:36,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:03:36,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:03:36,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:03:36,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:03:36,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:03:36,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:03:36,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:03:36,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:03:36,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-21 00:03:36,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:03:36,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:03:36,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:03:36,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:03:36,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:03:36,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:03:36,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:03:36,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:03:36,241 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:03:36,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:03:36,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:03:36,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:03:36,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:03:36,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:03:36,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:03:36,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:03:36,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:36,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:03:36,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:03:36,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:03:36,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:03:36,244 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32689ae30ae51ecba7c5b43dcb93819b27d0e14fbdff3ab2701407818eca0145 [2022-02-21 00:03:36,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:03:36,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:03:36,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:03:36,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:03:36,463 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:03:36,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-3.c [2022-02-21 00:03:36,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762334f46/873bc75cb4444c46b34e6e6061091d97/FLAG6fe0feea6 [2022-02-21 00:03:36,854 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:03:36,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/SyntaxSupportPointer01-3.c [2022-02-21 00:03:36,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762334f46/873bc75cb4444c46b34e6e6061091d97/FLAG6fe0feea6 [2022-02-21 00:03:37,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762334f46/873bc75cb4444c46b34e6e6061091d97 [2022-02-21 00:03:37,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:03:37,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:03:37,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:37,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:03:37,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:03:37,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679420d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37, skipping insertion in model container [2022-02-21 00:03:37,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:03:37,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:03:37,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:37,487 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:03:37,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:03:37,507 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:03:37,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37 WrapperNode [2022-02-21 00:03:37,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:03:37,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:37,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:03:37,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:03:37,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,534 INFO L137 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-21 00:03:37,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:03:37,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:03:37,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:03:37,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:03:37,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:03:37,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:03:37,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:03:37,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:03:37,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (1/1) ... [2022-02-21 00:03:37,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:03:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:03:37,601 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-21 00:03:37,615 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-21 00:03:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:03:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 00:03:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:03:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:03:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 00:03:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:03:37,691 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:03:37,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:03:37,863 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:03:37,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:03:37,883 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:03:37,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:37 BoogieIcfgContainer [2022-02-21 00:03:37,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:03:37,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:03:37,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:03:37,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:03:37,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:03:37" (1/3) ... [2022-02-21 00:03:37,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e28f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:37, skipping insertion in model container [2022-02-21 00:03:37,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:03:37" (2/3) ... [2022-02-21 00:03:37,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e28f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:03:37, skipping insertion in model container [2022-02-21 00:03:37,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:37" (3/3) ... [2022-02-21 00:03:37,891 INFO L111 eAbstractionObserver]: Analyzing ICFG SyntaxSupportPointer01-3.c [2022-02-21 00:03:37,895 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:03:37,895 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 00:03:37,941 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:03:37,949 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-21 00:03:37,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 00:03:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 23 states have internal predecessors, (25), 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-21 00:03:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:37,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:37,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:37,970 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-21 00:03:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-02-21 00:03:37,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:37,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654589458] [2022-02-21 00:03:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:38,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2022-02-21 00:03:38,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~mem2#1, main_#t~post3#1, main_#t~mem1#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset; {29#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:03:38,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {28#false} is VALID [2022-02-21 00:03:38,134 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-21 00:03:38,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:38,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654589458] [2022-02-21 00:03:38,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654589458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:38,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:38,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:38,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587782686] [2022-02-21 00:03:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:38,142 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-21 00:03:38,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:38,145 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-21 00:03:38,150 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-21 00:03:38,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:38,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:38,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:38,166 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 23 states have internal predecessors, (25), 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-21 00:03:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,210 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-21 00:03:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:38,210 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-21 00:03:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:38,211 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-21 00:03:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-21 00:03:38,214 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-21 00:03:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-02-21 00:03:38,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-02-21 00:03:38,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,242 INFO L225 Difference]: With dead ends: 20 [2022-02-21 00:03:38,242 INFO L226 Difference]: Without dead ends: 18 [2022-02-21 00:03:38,243 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-21 00:03:38,246 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:38,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 12 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-21 00:03:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 00:03:38,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:38,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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-21 00:03:38,273 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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-21 00:03:38,273 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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-21 00:03:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,275 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-21 00:03:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-21 00:03:38,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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 18 states. [2022-02-21 00:03:38,277 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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 18 states. [2022-02-21 00:03:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,278 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-21 00:03:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-21 00:03:38,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:38,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 17 states have internal predecessors, (18), 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-21 00:03:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-21 00:03:38,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 3 [2022-02-21 00:03:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:38,285 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-21 00:03:38,285 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-21 00:03:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-21 00:03:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 00:03:38,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:38,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 00:03:38,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:03:38,288 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-21 00:03:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 29862, now seen corresponding path program 1 times [2022-02-21 00:03:38,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:38,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51021903] [2022-02-21 00:03:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:38,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {106#true} is VALID [2022-02-21 00:03:38,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~mem2#1, main_#t~post3#1, main_#t~mem1#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset; {108#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:03:38,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 4)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {107#false} is VALID [2022-02-21 00:03:38,346 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-21 00:03:38,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:38,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51021903] [2022-02-21 00:03:38,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51021903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:38,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:38,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:38,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043247593] [2022-02-21 00:03:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:38,350 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-21 00:03:38,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:38,351 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-21 00:03:38,354 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-21 00:03:38,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:38,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:38,357 INFO L87 Difference]: Start difference. First operand 18 states and 18 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-21 00:03:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,398 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 00:03:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:38,399 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-21 00:03:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:38,399 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-21 00:03:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 00:03:38,400 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-21 00:03:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 00:03:38,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-21 00:03:38,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,419 INFO L225 Difference]: With dead ends: 14 [2022-02-21 00:03:38,419 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 00:03:38,420 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-21 00:03:38,424 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:38,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 00:03:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 00:03:38,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:38,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-21 00:03:38,428 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-21 00:03:38,428 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-21 00:03:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,429 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 00:03:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 00:03:38,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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 14 states. [2022-02-21 00:03:38,430 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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 14 states. [2022-02-21 00:03:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,431 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 00:03:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 00:03:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:38,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-21 00:03:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-02-21 00:03:38,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-02-21 00:03:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:38,434 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-02-21 00:03:38,434 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-21 00:03:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 00:03:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:03:38,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:38,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:03:38,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:03:38,435 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-21 00:03:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 889571657, now seen corresponding path program 1 times [2022-02-21 00:03:38,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:38,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621788496] [2022-02-21 00:03:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:38,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {167#true} is VALID [2022-02-21 00:03:38,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~mem2#1, main_#t~post3#1, main_#t~mem1#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset; {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:38,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call main_#t~mem1#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L15-3 {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:38,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_#t~mem1#1 >= 0);havoc main_#t~mem1#1; {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:38,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume 0 == main_~p~0#1.offset; {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:03:38,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_~p~0#1.base < #StackHeapBarrier); {168#false} is VALID [2022-02-21 00:03:38,465 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-21 00:03:38,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:38,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621788496] [2022-02-21 00:03:38,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621788496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:38,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:38,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:03:38,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102405004] [2022-02-21 00:03:38,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:03:38,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:38,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 00:03:38,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:38,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:38,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:38,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:38,474 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 00:03:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,491 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 00:03:38,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 00:03:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 00:03:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 00:03:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 00:03:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 00:03:38,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2022-02-21 00:03:38,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,506 INFO L225 Difference]: With dead ends: 13 [2022-02-21 00:03:38,506 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 00:03:38,507 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-21 00:03:38,508 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:38,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 00:03:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 00:03:38,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:38,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-21 00:03:38,510 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-21 00:03:38,510 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-21 00:03:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,511 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 00:03:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 00:03:38,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 13 states. [2022-02-21 00:03:38,512 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 13 states. [2022-02-21 00:03:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,513 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-21 00:03:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 00:03:38,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:38,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-21 00:03:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 00:03:38,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 6 [2022-02-21 00:03:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:38,515 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 00:03:38,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 00:03:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 00:03:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 00:03:38,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:38,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:38,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:03:38,517 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-21 00:03:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 179872428, now seen corresponding path program 1 times [2022-02-21 00:03:38,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:38,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501782138] [2022-02-21 00:03:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:38,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {224#true} is VALID [2022-02-21 00:03:38,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~mem2#1, main_#t~post3#1, main_#t~mem1#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnHeap(4);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset; {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:38,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} SUMMARY for call main_#t~mem1#1 := read~int(main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L15-3 {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:38,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume !(main_#t~mem1#1 >= 0);havoc main_#t~mem1#1; {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:38,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~p~0#1.offset; {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:38,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume main_~p~0#1.base < #StackHeapBarrier; {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-21 00:03:38,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(= (store |#valid| |ULTIMATE.start_main_~p~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)} assume 0 == main_~p~0#1.base || 1 == #valid[main_~p~0#1.base];call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset);main_#res#1 := 0; {227#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:03:38,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {225#false} is VALID [2022-02-21 00:03:38,561 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-21 00:03:38,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:38,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501782138] [2022-02-21 00:03:38,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501782138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:38,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:38,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:38,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811432242] [2022-02-21 00:03:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) Word has length 8 [2022-02-21 00:03:38,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:38,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-21 00:03:38,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:03:38,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:03:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:03:38,570 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-21 00:03:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,601 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-21 00:03:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 00:03:38,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) Word has length 8 [2022-02-21 00:03:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-21 00:03:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 00:03:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-21 00:03:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 00:03:38,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2022-02-21 00:03:38,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:38,614 INFO L225 Difference]: With dead ends: 12 [2022-02-21 00:03:38,614 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 00:03:38,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:03:38,615 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:38,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 00:03:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 00:03:38,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:38,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 00:03:38,617 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 00:03:38,617 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 00:03:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,618 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:38,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 00:03:38,618 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 00:03:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:38,618 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 00:03:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:38,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:38,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:38,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-21 00:03:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 00:03:38,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2022-02-21 00:03:38,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:38,620 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 00:03:38,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-21 00:03:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 00:03:38,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:38,622 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (9 of 10 remaining) [2022-02-21 00:03:38,622 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (8 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (7 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (6 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (5 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (4 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-02-21 00:03:38,623 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-02-21 00:03:38,624 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-02-21 00:03:38,624 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-02-21 00:03:38,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:03:38,626 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 00:03:38,627 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:03:38,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:03:38 BoogieIcfgContainer [2022-02-21 00:03:38,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:03:38,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:03:38,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:03:38,630 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:03:38,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:03:37" (3/4) ... [2022-02-21 00:03:38,632 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 00:03:38,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-21 00:03:38,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-21 00:03:38,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-21 00:03:38,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 00:03:38,662 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:03:38,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:03:38,663 INFO L158 Benchmark]: Toolchain (without parser) took 1373.39ms. Allocated memory is still 153.1MB. Free memory was 119.1MB in the beginning and 57.2MB in the end (delta: 61.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,663 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 60.3MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:38,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 129.7MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.49ms. Allocated memory is still 153.1MB. Free memory was 129.7MB in the beginning and 128.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,664 INFO L158 Benchmark]: Boogie Preprocessor took 30.94ms. Allocated memory is still 153.1MB. Free memory was 128.5MB in the beginning and 127.6MB in the end (delta: 887.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:03:38,665 INFO L158 Benchmark]: RCFGBuilder took 316.38ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 116.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,665 INFO L158 Benchmark]: TraceAbstraction took 743.17ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 59.3MB in the end (delta: 55.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,665 INFO L158 Benchmark]: Witness Printer took 32.32ms. Allocated memory is still 153.1MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:03:38,667 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.17ms. Allocated memory is still 86.0MB. Free memory was 60.3MB in the beginning and 60.3MB in the end (delta: 27.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.49ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 129.7MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.49ms. Allocated memory is still 153.1MB. Free memory was 129.7MB in the beginning and 128.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.94ms. Allocated memory is still 153.1MB. Free memory was 128.5MB in the beginning and 127.6MB in the end (delta: 887.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 316.38ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 116.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 743.17ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 59.3MB in the end (delta: 55.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 32.32ms. Allocated memory is still 153.1MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 18]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 18]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 13]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, 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, 39 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 33 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-21 00:03:38,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE